
Here we will show you how to convert the hexadecimal number D9D1 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 D9D1 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in D9D1 by 16⁰, multiply the second to last digit in D9D1 by 16¹, multiply the third to last digit in D9D1 by 16², multiply the fourth to last digit in D9D1 by 16³, and so on, until all the digits are used.
1 × 16⁰ = 1
D × 16¹ = 208
9 × 16² = 2304
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 + 2304 + 53248 = 55761
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.
55761 ÷ 2 = 27880 with 1 remainder
27880 ÷ 2 = 13940 with 0 remainder
13940 ÷ 2 = 6970 with 0 remainder
6970 ÷ 2 = 3485 with 0 remainder
3485 ÷ 2 = 1742 with 1 remainder
1742 ÷ 2 = 871 with 0 remainder
871 ÷ 2 = 435 with 1 remainder
435 ÷ 2 = 217 with 1 remainder
217 ÷ 2 = 108 with 1 remainder
108 ÷ 2 = 54 with 0 remainder
54 ÷ 2 = 27 with 0 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 D9D1 hexadecimal to binary:
D9D1 hexadecimal = 1101100111010001 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
D9D2 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
