
Here we will show you how to convert the hexadecimal number DAC5 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 DAC5 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in DAC5 by 16⁰, multiply the second to last digit in DAC5 by 16¹, multiply the third to last digit in DAC5 by 16², multiply the fourth to last digit in DAC5 by 16³, and so on, until all the digits are used.
5 × 16⁰ = 5
C × 16¹ = 192
A × 16² = 2560
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:
5 + 192 + 2560 + 53248 = 56005
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.
56005 ÷ 2 = 28002 with 1 remainder
28002 ÷ 2 = 14001 with 0 remainder
14001 ÷ 2 = 7000 with 1 remainder
7000 ÷ 2 = 3500 with 0 remainder
3500 ÷ 2 = 1750 with 0 remainder
1750 ÷ 2 = 875 with 0 remainder
875 ÷ 2 = 437 with 1 remainder
437 ÷ 2 = 218 with 1 remainder
218 ÷ 2 = 109 with 0 remainder
109 ÷ 2 = 54 with 1 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 DAC5 hexadecimal to binary:
DAC5 hexadecimal = 1101101011000101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
DAC6 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
