
Here we will show you how to convert the hexadecimal number D492 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 D492 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in D492 by 16⁰, multiply the second to last digit in D492 by 16¹, multiply the third to last digit in D492 by 16², multiply the fourth to last digit in D492 by 16³, and so on, until all the digits are used.
2 × 16⁰ = 2
9 × 16¹ = 144
4 × 16² = 1024
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:
2 + 144 + 1024 + 53248 = 54418
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.
54418 ÷ 2 = 27209 with 0 remainder
27209 ÷ 2 = 13604 with 1 remainder
13604 ÷ 2 = 6802 with 0 remainder
6802 ÷ 2 = 3401 with 0 remainder
3401 ÷ 2 = 1700 with 1 remainder
1700 ÷ 2 = 850 with 0 remainder
850 ÷ 2 = 425 with 0 remainder
425 ÷ 2 = 212 with 1 remainder
212 ÷ 2 = 106 with 0 remainder
106 ÷ 2 = 53 with 0 remainder
53 ÷ 2 = 26 with 1 remainder
26 ÷ 2 = 13 with 0 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 D492 hexadecimal to binary:
D492 hexadecimal = 1101010010010010 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
D493 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
