Summarize this article:
Last updated on August 26, 2025
765 in binary is written as 1011111101 because the binary system uses only two digits, 0 and 1, to represent numbers. This number system is widely used in computer systems. In this topic, we are going to learn about the binary representation of 765.
The process of converting 765 from decimal to binary involves dividing the number 765 by 2. Here, it is divided by 2 because the binary number system uses only 2 digits (0 and 1). The quotient becomes the dividend in the next step, and the process continues until the quotient becomes 0.
This is a commonly used method to convert 765 to binary. In the last step, the remainder is noted down in reverse order, and that becomes the converted value.
For example, the remainders noted down after dividing 765 by 2 until getting 0 as the quotient is 1011111101. Remember, the remainders here have been written upside down.
In the table shown below, the first column shows the binary digits (1 and 0) as 765.
The second column represents the place values of each digit, and the third column is the value calculation, where the binary digits are multiplied by their corresponding place values.
The results of the third column can be added to cross-check if 1011111101 in binary is indeed 765 in the decimal number system.
765 can be converted easily from decimal to binary. The methods mentioned below will help us convert the number. Let’s see how it is done.
Expansion Method: Let us see the step-by-step process of converting 765 using the expansion method.
Step 1 - Figure out the place values:
In the binary system, each place value is a power of 2. Therefore, in the first step, we will ascertain the powers of 2.
20 = 1
21 = 2
22 = 4
23 = 8
24 = 16
25 = 32
26 = 64
27 = 128
28 = 256
29 = 512 Since 512 is less than 765 and the next power, 1024, is greater, we stop at 29 = 512.
Step 2 - Identify the largest power of 2:
In the previous step, we stopped at 29 = 512. This is because in this step, we have to identify the largest power of 2, which is less than or equal to the given number, 765. Since 29 is the number we are looking for, write 1 in the 29 place. Now the value of 29, which is 512, is subtracted from 765. 765 - 512 = 253.
Step 3 - Identify the next largest power of 2:
In this step, we need to find the largest power of 2 that fits into the result of the previous step, 253. So, the next largest power of 2 is 28, which is 256. Since 28 is slightly more than 253, we move to 27 = 128. We write 1 in the 27 place. Now subtract 128 from 253. 253 - 128 = 125.
Step 4 - Continue identifying and subtracting powers of 2:
26 = 64. Write 1 in the 26 place. 125 - 64 = 61. 25 = 32. Write 1 in the 25 place. 61 - 32 = 29. 24 = 16. Write 1 in the 24 place. 29 - 16 = 13. 23 = 8. Write 1 in the 23 place. 13 - 8 = 5. 22 = 4. Write 1 in the 22 place. 5 - 4 = 1. 21 = 2. Write 0 in the 21 place (as 1 is less than 2). 20 = 1. Write 1 in the 20 place. 1 - 1 = 0.
Step 5 - Write the values in reverse order:
We now write the numbers upside down to represent 765 in binary. Therefore, 1011111101 is 765 in binary.
Grouping Method: In this method, we divide the number 765 by 2. Let us see the step-by-step conversion.
Step 1 - Divide the given number 765 by 2. 765 / 2 = 382 with a remainder of 1.
Step 2 - Divide the previous quotient (382) by 2. 382 / 2 = 191 with a remainder of 0.
Step 3 - Repeat the previous step. 191 / 2 = 95 with a remainder of 1.
Step 4 - Repeat the previous step. 95 / 2 = 47 with a remainder of 1.
Step 5 - Repeat the previous step. 47 / 2 = 23 with a remainder of 1.
Step 6 - Repeat the previous step. 23 / 2 = 11 with a remainder of 1.
Step 7 - Repeat the previous step. 11 / 2 = 5 with a remainder of 1.
Step 8 - Repeat the previous step. 5 / 2 = 2 with a remainder of 1.
Step 9 - Repeat the previous step. 2 / 2 = 1 with a remainder of 0.
Step 10 - Repeat the previous step. 1 / 2 = 0 with a remainder of 1.
Step 11 - Write down the remainders from bottom to top. Therefore, 765 (decimal) = 1011111101 (binary).
There are certain rules to follow when converting any number to binary. Some of them are mentioned below:
This is one of the most commonly used rules to convert any number to binary. The place value method is the same as the expansion method, where we need to find the largest power of 2. Let’s see a brief step-by-step explanation to understand the first rule. Find the largest power of 2 less than or equal to 765. Since the answer is 29, write 1 next to this power of 2. Subtract the value (512) from 765. So, 765 - 512 = 253. Find the largest power of 2 less than or equal to 253. The answer is 27. So, write 1 next to this power. Continue this process until the remainder is 0. Final conversion will be 1011111101.
The division by 2 method is the same as the grouping method. A brief step-by-step explanation is given below for better understanding. First, 765 is divided by 2 to get 382 as the quotient and 1 as the remainder. Now, 382 is divided by 2. Here, we will get 191 as the quotient and 0 as the remainder. Continue this division process until the quotient becomes 0. Now, we write the remainders upside down to get the binary equivalent of 765, 1011111101.
This rule also involves breaking the number into powers of 2. Identify the powers of 2 and write them down in decreasing order i.e., 29, 28, 27, and so on. Find the largest power that fits into 765. Repeat the process and allocate 1s and 0s to the suitable powers of 2. Combine the digits (0 and 1) to get the binary result.
The limitation of the binary system is that only 0s and 1s can be used to represent numbers. The system doesn’t use any other digits other than 0 and 1. This is a base 2 number system, where the binary places represent powers of 2. So, every digit is either a 0 or a 1. To convert 765, we use 0s and 1s according to the powers of 2.
Learning a few tips and tricks is a great way to solve any mathematical problems easily. Let us take a look at some tips and tricks for binary numbers up to 765.
Memorize to speed up conversions: We can memorize the binary forms for numbers to make conversion quicker.
Recognize the patterns: There is a peculiar pattern when converting numbers from decimal to binary.
Even and odd rule: Whenever a number is even, its binary form will end in 0. For e.g., 20 is even and its binary form is 10100. Here, the binary of 20 ends in 0. If the number is odd, then its binary equivalent will end in 1.
Cross-verify the answers: Once the conversion is done, we can cross-verify the answers by converting the number back to the decimal form. This will eliminate any unforeseen errors in conversion.
Practice by using tables: Writing the decimal numbers and their binary equivalents on a table will help us remember the conversions.
Here, let us take a look at some of the most commonly made mistakes while converting numbers to binary.
Convert 765 from decimal to binary using the place value method.
1011111101
29 is the largest power of 2, which is less than or equal to 765.
So place 1 next to 29.
Subtracting 512 from 765, we get 253.
The next largest power would be 27.
So place another 1 next to 27.
Continue this process until the remaining value is 0.
By using this method, we find the binary form of 765.
Convert 765 from decimal to binary using the division by 2 method.
1011111101
Divide 765 by 2.
In the next step, the quotient becomes the new dividend.
Continue the process until the quotient becomes 0.
Now, write the remainders upside down to get the final result.
Convert 765 to binary using the representation method.
1011111101
Break the number 765 into powers of 2 and find the largest powers of 2.
We get 29.
So 1 is placed next to 29.
Next, 765 - 512 = 253.
Now, the largest power of 2 is 27.
Once again, 1 is placed next to 27.
Now, continue this process until there is no remainder.
After getting 0, fill in with zeros for unused powers of 2.
By following this method, we get the binary value of 765 as 1011111101.
How is 765 written in decimal, octal, and binary form?
Decimal form - 765 Octal - 1365 Binary - 1011111101
The decimal system is also called the base 10 system.
In this system, 765 is written as 765 only.
We have already seen how 765 is written as 1011111101 in binary.
So, let us focus on the octal system, which is base 8.
To convert 765 to octal, we need to divide 765 by 8.
So 765 / 8 = 95 with 5 as the remainder.
In the next step, divide the quotient from the previous step (95) by 8.
So 95 / 8 = 11 with 7 as the remainder.
Finally, 11 / 8 = 1 with 3 as the remainder.
The division process stops here because the quotient is now 0.
Here, 3, 7, and 5 are the remainders, and they have to be written in reverse order.
So, 1365 is the octal equivalent of 765.
Express 765 - 100 in binary.
101010101
765 - 100 = 665 So, we need to write 665 in binary.
Start by dividing 665 by 2.
We get 332 as the quotient and 1 as the remainder.
Next, divide 332 by 2.
Now we get 166 as the quotient and 0 as the remainder.
Continue this division process until the quotient becomes 0.
Now write the remainders from bottom to top to get 101010101 (binary of 665).
Hiralee Lalitkumar Makwana has almost two years of teaching experience. She is a number ninja as she loves numbers. Her interest in numbers can be seen in the way she cracks math puzzles and hidden patterns.
: She loves to read number jokes and games.