
Here we will show you how to convert the hexadecimal number D65D 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 D65D from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in D65D by 16⁰, multiply the second to last digit in D65D by 16¹, multiply the third to last digit in D65D by 16², multiply the fourth to last digit in D65D by 16³, and so on, until all the digits are used.
D × 16⁰ = 13
5 × 16¹ = 80
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:
13 + 80 + 1536 + 53248 = 54877
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.
54877 ÷ 2 = 27438 with 1 remainder
27438 ÷ 2 = 13719 with 0 remainder
13719 ÷ 2 = 6859 with 1 remainder
6859 ÷ 2 = 3429 with 1 remainder
3429 ÷ 2 = 1714 with 1 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 D65D hexadecimal to binary:
D65D hexadecimal = 1101011001011101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
D65E hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
