
Here we will show you how to convert the hexadecimal number AD49 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 AD49 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in AD49 by 16⁰, multiply the second to last digit in AD49 by 16¹, multiply the third to last digit in AD49 by 16², multiply the fourth to last digit in AD49 by 16³, and so on, until all the digits are used.
9 × 16⁰ = 9
4 × 16¹ = 64
D × 16² = 3328
A × 16³ = 40960
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:
9 + 64 + 3328 + 40960 = 44361
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.
44361 ÷ 2 = 22180 with 1 remainder
22180 ÷ 2 = 11090 with 0 remainder
11090 ÷ 2 = 5545 with 0 remainder
5545 ÷ 2 = 2772 with 1 remainder
2772 ÷ 2 = 1386 with 0 remainder
1386 ÷ 2 = 693 with 0 remainder
693 ÷ 2 = 346 with 1 remainder
346 ÷ 2 = 173 with 0 remainder
173 ÷ 2 = 86 with 1 remainder
86 ÷ 2 = 43 with 0 remainder
43 ÷ 2 = 21 with 1 remainder
21 ÷ 2 = 10 with 1 remainder
10 ÷ 2 = 5 with 0 remainder
5 ÷ 2 = 2 with 1 remainder
2 ÷ 2 = 1 with 0 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 AD49 hexadecimal to binary:
AD49 hexadecimal = 1010110101001001 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
AD4A hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
