103 in Binary

The process of converting 103 from decimal to binary involves dividing the number 103 by 2. Here, it is getting 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 103 to binary. In the last step, the remainder is noted down bottom side up, and that becomes the converted value.

For example, the remainders noted down after dividing 103 by 2 until getting 0 as the quotient is 1100111. 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 1100111.

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 1100111 in binary is indeed 103 in the decimal number system.

103 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 103 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. 2^0 = 1 2^1 = 2 2^2 = 4 2^3 = 8 2^4 = 16 2^5 = 32 2^6 = 64 Since 64 is less than 103, we stop at 2^6 = 64.

Step 2 - Identify the largest power of 2: In the previous step, we stopped at 2^6 = 64. 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, 103. Since 2^6 is the largest number we are looking for, write 1 in the 2^6 place. Now the value of 2^6, which is 64, is subtracted from 103. 103 - 64 = 39.

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, 39. So, the next largest power of 2 is 2^5, which is 32. Now, we have to write 1 in the 2^5 place. And then subtract 32 from 39. 39 - 32 = 7.

Step 4 - Continue the process: Next, identify the largest power of 2 that fits into 7, which is 2^2 = 4. Write 1 in the 2^2 place. Subtract 4 from 7. 7 - 4 = 3.

Step 5 - Continue with the remaining numbers: Identify the largest power of 2 that fits into 3, which is 2^1 = 2. Write 1 in the 2^1 place. Subtract 2 from 3. 3 - 2 = 1. Finally, write 1 in the 2^0 place. Subtract 1 from 1. 1 - 1 = 0. We need to stop the process here since the remainder is 0.

Step 6 - Write the unused place values: In steps above, we wrote 1 in the 2^6, 2^5, 2^2, 2^1, and 2^0 places. Now, we can just write 0s in the remaining places, which are 2^4 and 2^3. Now, by substituting the values, we get, 0 in the 2^4 place 0 in the 2^3 place 1 in the 2^2 place 1 in the 2^1 place 1 in the 2^0 place 1 in the 2^5 place 1 in the 2^6 place So, 1100111 is 103 in binary.

Grouping Method: In this method, we divide the number 103 by 2. Let us see the step-by-step conversion.

Step 1 - Divide the given number 103 by 2. 103 / 2 = 51. Here, 51 is the quotient and 1 is the remainder.

Step 2 - Divide the previous quotient (51) by 2. 51 / 2 = 25. Here, the quotient is 25 and the remainder is 1.

Step 3 - Repeat the previous step. 25 / 2 = 12. Now, the quotient is 12 and the remainder is 1.

Step 4 - Repeat the previous step. 12 / 2 = 6. Here, the quotient is 6 and the remainder is 0.

Step 5 - Repeat the previous step. 6 / 2 = 3. Here, the quotient is 3 and the remainder is 0.

Step 6 - Repeat the previous step. 3 / 2 = 1. Here, the quotient is 1 and the remainder is 1.

Step 7 - Repeat the previous step. 1 / 2 = 0. Here, the remainder is 1. And we stop the division here because the quotient is 0.

Step 8 - Write down the remainders from bottom to top. Therefore, 103 (decimal) = 1100111 (binary).

There are certain rules to follow when converting any number to binary. Some of them are mentioned below:

Rule 1: Place Value Method

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 103. Since the answer is 2^6, write 1 next to this power of 2. Subtract the value (64) from 103. So, 103 - 64 = 39. Find the largest power of 2 less than or equal to 39. The answer is 2^5. So, write 1 next to this power. Now, 39 - 32 = 7. Find the largest power of 2 less than or equal to 7. The answer is 2^2. So, write 1 next to this power, and continue this process until you end with 0. Final conversion will be 1100111.

Rule 2: Division by 2 Method

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, 103 is divided by 2 to get 51 as the quotient and 1 as the remainder. Now, 51 is divided by 2. Here, we will get 25 as the quotient and 1 as the remainder. Continuing this process, dividing each quotient by 2 until the quotient is 0. Now, we write the remainders upside down to get the binary equivalent of 103, 1100111.

Rule 3: Representation Method

This rule also involves breaking the number into powers of 2. Identify the powers of 2 and write it down in decreasing order i.e., 2^6, 2^5, 2^4, 2^3, 2^2, 2^1, and 2^0. Find the largest power that fits into 103. 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.

Rule 4: Limitation Rule

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 103, we use 0s for 2^4 and 2^3, and 1s for 2^6, 2^5, 2^2, 2^1, and 2^0.

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 103.

Memorize to speed up conversions: We can memorize the binary forms for numbers 1 to 103. 1 → 1, 2 → 10, 3 → 11, 4 → 100, 5 → 101, ..., 103 → 1100111.

Recognize the patterns: There is a peculiar pattern when converting numbers from decimal to binary. 1 → 1 1 + 1 = 2 → 10 2 + 2 = 4 → 100 4 + 4 = 8 → 1000 8 + 8 = 16 → 10000 16 + 16 = 32 → 100000… and so on. This is also called the double and add rule.

Even and odd rule: Whenever a number is even, its binary form will end in 0. For e.g., 102 is even and its binary form is 1100110. Here, the binary of 102 ends in 0. If the number is odd, then its binary equivalent will end in 1. For e.g., the binary of 103 (an odd number) is 1100111. As you can see, the last digit here is 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.

• Decimal: It is the base 10 number system, which uses digits from 0 to 9.

• Binary: This number system uses only 0 and 1. It is also called the base 2 number system.

• Place value: Every digit has a value based on its position in a given number. For e.g., in 1100111 (base 2), each 1 or 0 has a specific place value determined by powers of 2.

• Octal: It is the number system with a base of 8. It uses digits from 0 to 7.

• Powers of 2: Used in binary systems where each digit represents a power of 2. For example, 2^0, 2^1, 2^2, etc.