
Here we will show you how to convert the hexadecimal number B6DC to a binary number. First note that the hexadecimal number system has sixteen different digits (0 1 2 3 4 5 6 7 8 9 A B C D E F) and the binary number system has only two different digits (0 and 1).
The four steps used to convert B6DC from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in B6DC by 16⁰, multiply the second to last digit in B6DC by 16¹, multiply the third to last digit in B6DC by 16², multiply the fourth to last digit in B6DC by 16³, and so on, until all the digits are used.
C × 16⁰ = 12
D × 16¹ = 208
6 × 16² = 1536
B × 16³ = 45056
Remember that the hexadecimal number system has sixteen different digits, so when doing the above calculation, we use the following values if applicable: A=10, B=11, C=12, D=13, E=14, and F=15.
Step 2)
Next, we add up all the products we got from Step 1, like this:
12 + 208 + 1536 + 45056 = 46812
Step 3)
Now we divide the sum from Step 2 by 2. Put the remainder aside. Then divide the whole part by 2 again, and put the remainder aside again. Keep doing this until the whole part is 0.
46812 ÷ 2 = 23406 with 0 remainder
23406 ÷ 2 = 11703 with 0 remainder
11703 ÷ 2 = 5851 with 1 remainder
5851 ÷ 2 = 2925 with 1 remainder
2925 ÷ 2 = 1462 with 1 remainder
1462 ÷ 2 = 731 with 0 remainder
731 ÷ 2 = 365 with 1 remainder
365 ÷ 2 = 182 with 1 remainder
182 ÷ 2 = 91 with 0 remainder
91 ÷ 2 = 45 with 1 remainder
45 ÷ 2 = 22 with 1 remainder
22 ÷ 2 = 11 with 0 remainder
11 ÷ 2 = 5 with 1 remainder
5 ÷ 2 = 2 with 1 remainder
2 ÷ 2 = 1 with 0 remainder
1 ÷ 2 = 0 with 1 remainder
Step 4)
In the final step, we take the remainders from Step 3 and put them together in reverse order to get our answer to B6DC hexadecimal to binary:
B6DC hexadecimal = 1011011011011100 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
B6DD hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
