
Here we will show you how to convert the hexadecimal number DDF9 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 DDF9 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in DDF9 by 16⁰, multiply the second to last digit in DDF9 by 16¹, multiply the third to last digit in DDF9 by 16², multiply the fourth to last digit in DDF9 by 16³, and so on, until all the digits are used.
9 × 16⁰ = 9
F × 16¹ = 240
D × 16² = 3328
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:
9 + 240 + 3328 + 53248 = 56825
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.
56825 ÷ 2 = 28412 with 1 remainder
28412 ÷ 2 = 14206 with 0 remainder
14206 ÷ 2 = 7103 with 0 remainder
7103 ÷ 2 = 3551 with 1 remainder
3551 ÷ 2 = 1775 with 1 remainder
1775 ÷ 2 = 887 with 1 remainder
887 ÷ 2 = 443 with 1 remainder
443 ÷ 2 = 221 with 1 remainder
221 ÷ 2 = 110 with 1 remainder
110 ÷ 2 = 55 with 0 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 DDF9 hexadecimal to binary:
DDF9 hexadecimal = 1101110111111001 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
DDFA hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact