
Here we will show you how to convert the hexadecimal number D93C 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 D93C from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in D93C by 16⁰, multiply the second to last digit in D93C by 16¹, multiply the third to last digit in D93C by 16², multiply the fourth to last digit in D93C by 16³, and so on, until all the digits are used.
C × 16⁰ = 12
3 × 16¹ = 48
9 × 16² = 2304
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 + 48 + 2304 + 53248 = 55612
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.
55612 ÷ 2 = 27806 with 0 remainder
27806 ÷ 2 = 13903 with 0 remainder
13903 ÷ 2 = 6951 with 1 remainder
6951 ÷ 2 = 3475 with 1 remainder
3475 ÷ 2 = 1737 with 1 remainder
1737 ÷ 2 = 868 with 1 remainder
868 ÷ 2 = 434 with 0 remainder
434 ÷ 2 = 217 with 0 remainder
217 ÷ 2 = 108 with 1 remainder
108 ÷ 2 = 54 with 0 remainder
54 ÷ 2 = 27 with 0 remainder
27 ÷ 2 = 13 with 1 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 D93C hexadecimal to binary:
D93C hexadecimal = 1101100100111100 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
D93D hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact