
Here we will show you how to convert the hexadecimal number D602 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 D602 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in D602 by 16⁰, multiply the second to last digit in D602 by 16¹, multiply the third to last digit in D602 by 16², multiply the fourth to last digit in D602 by 16³, and so on, until all the digits are used.
2 × 16⁰ = 2
0 × 16¹ = 0
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:
2 + 0 + 1536 + 53248 = 54786
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.
54786 ÷ 2 = 27393 with 0 remainder
27393 ÷ 2 = 13696 with 1 remainder
13696 ÷ 2 = 6848 with 0 remainder
6848 ÷ 2 = 3424 with 0 remainder
3424 ÷ 2 = 1712 with 0 remainder
1712 ÷ 2 = 856 with 0 remainder
856 ÷ 2 = 428 with 0 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 D602 hexadecimal to binary:
D602 hexadecimal = 1101011000000010 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
D603 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
