
Here we will show you how to convert the hexadecimal number D64C 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 D64C from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in D64C by 16⁰, multiply the second to last digit in D64C by 16¹, multiply the third to last digit in D64C by 16², multiply the fourth to last digit in D64C by 16³, and so on, until all the digits are used.
C × 16⁰ = 12
4 × 16¹ = 64
6 × 16² = 1536
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:
12 + 64 + 1536 + 53248 = 54860
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.
54860 ÷ 2 = 27430 with 0 remainder
27430 ÷ 2 = 13715 with 0 remainder
13715 ÷ 2 = 6857 with 1 remainder
6857 ÷ 2 = 3428 with 1 remainder
3428 ÷ 2 = 1714 with 0 remainder
1714 ÷ 2 = 857 with 0 remainder
857 ÷ 2 = 428 with 1 remainder
428 ÷ 2 = 214 with 0 remainder
214 ÷ 2 = 107 with 0 remainder
107 ÷ 2 = 53 with 1 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 D64C hexadecimal to binary:
D64C hexadecimal = 1101011001001100 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
D64D hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
