
Here we will show you how to convert the hexadecimal number DFD1 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 DFD1 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in DFD1 by 16⁰, multiply the second to last digit in DFD1 by 16¹, multiply the third to last digit in DFD1 by 16², multiply the fourth to last digit in DFD1 by 16³, and so on, until all the digits are used.
1 × 16⁰ = 1
D × 16¹ = 208
F × 16² = 3840
D × 16³ = 53248
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:
1 + 208 + 3840 + 53248 = 57297
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.
57297 ÷ 2 = 28648 with 1 remainder
28648 ÷ 2 = 14324 with 0 remainder
14324 ÷ 2 = 7162 with 0 remainder
7162 ÷ 2 = 3581 with 0 remainder
3581 ÷ 2 = 1790 with 1 remainder
1790 ÷ 2 = 895 with 0 remainder
895 ÷ 2 = 447 with 1 remainder
447 ÷ 2 = 223 with 1 remainder
223 ÷ 2 = 111 with 1 remainder
111 ÷ 2 = 55 with 1 remainder
55 ÷ 2 = 27 with 1 remainder
27 ÷ 2 = 13 with 1 remainder
13 ÷ 2 = 6 with 1 remainder
6 ÷ 2 = 3 with 0 remainder
3 ÷ 2 = 1 with 1 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 DFD1 hexadecimal to binary:
DFD1 hexadecimal = 1101111111010001 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
DFD2 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
