
Here we will show you how to convert the hexadecimal number DAA2 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 DAA2 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in DAA2 by 16⁰, multiply the second to last digit in DAA2 by 16¹, multiply the third to last digit in DAA2 by 16², multiply the fourth to last digit in DAA2 by 16³, and so on, until all the digits are used.
2 × 16⁰ = 2
A × 16¹ = 160
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:
2 + 160 + 2560 + 53248 = 55970
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.
55970 ÷ 2 = 27985 with 0 remainder
27985 ÷ 2 = 13992 with 1 remainder
13992 ÷ 2 = 6996 with 0 remainder
6996 ÷ 2 = 3498 with 0 remainder
3498 ÷ 2 = 1749 with 0 remainder
1749 ÷ 2 = 874 with 1 remainder
874 ÷ 2 = 437 with 0 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 DAA2 hexadecimal to binary:
DAA2 hexadecimal = 1101101010100010 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
DAA3 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
