
Here we will show you how to convert the hexadecimal number DD05 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 DD05 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in DD05 by 16⁰, multiply the second to last digit in DD05 by 16¹, multiply the third to last digit in DD05 by 16², multiply the fourth to last digit in DD05 by 16³, and so on, until all the digits are used.
5 × 16⁰ = 5
0 × 16¹ = 0
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:
5 + 0 + 3328 + 53248 = 56581
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.
56581 ÷ 2 = 28290 with 1 remainder
28290 ÷ 2 = 14145 with 0 remainder
14145 ÷ 2 = 7072 with 1 remainder
7072 ÷ 2 = 3536 with 0 remainder
3536 ÷ 2 = 1768 with 0 remainder
1768 ÷ 2 = 884 with 0 remainder
884 ÷ 2 = 442 with 0 remainder
442 ÷ 2 = 221 with 0 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 DD05 hexadecimal to binary:
DD05 hexadecimal = 1101110100000101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
DD06 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
