
Here we will show you how to convert the hexadecimal number D768 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 D768 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in D768 by 16⁰, multiply the second to last digit in D768 by 16¹, multiply the third to last digit in D768 by 16², multiply the fourth to last digit in D768 by 16³, and so on, until all the digits are used.
8 × 16⁰ = 8
6 × 16¹ = 96
7 × 16² = 1792
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:
8 + 96 + 1792 + 53248 = 55144
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.
55144 ÷ 2 = 27572 with 0 remainder
27572 ÷ 2 = 13786 with 0 remainder
13786 ÷ 2 = 6893 with 0 remainder
6893 ÷ 2 = 3446 with 1 remainder
3446 ÷ 2 = 1723 with 0 remainder
1723 ÷ 2 = 861 with 1 remainder
861 ÷ 2 = 430 with 1 remainder
430 ÷ 2 = 215 with 0 remainder
215 ÷ 2 = 107 with 1 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 D768 hexadecimal to binary:
D768 hexadecimal = 1101011101101000 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
D769 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
