
Here we will show you how to convert the hexadecimal number BDFC 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 BDFC from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in BDFC by 16⁰, multiply the second to last digit in BDFC by 16¹, multiply the third to last digit in BDFC by 16², multiply the fourth to last digit in BDFC by 16³, and so on, until all the digits are used.
C × 16⁰ = 12
F × 16¹ = 240
D × 16² = 3328
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 + 240 + 3328 + 45056 = 48636
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.
48636 ÷ 2 = 24318 with 0 remainder
24318 ÷ 2 = 12159 with 0 remainder
12159 ÷ 2 = 6079 with 1 remainder
6079 ÷ 2 = 3039 with 1 remainder
3039 ÷ 2 = 1519 with 1 remainder
1519 ÷ 2 = 759 with 1 remainder
759 ÷ 2 = 379 with 1 remainder
379 ÷ 2 = 189 with 1 remainder
189 ÷ 2 = 94 with 1 remainder
94 ÷ 2 = 47 with 0 remainder
47 ÷ 2 = 23 with 1 remainder
23 ÷ 2 = 11 with 1 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 BDFC hexadecimal to binary:
BDFC hexadecimal = 1011110111111100 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
BDFD hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
