
Here we will show you how to convert the hexadecimal number AD30 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 AD30 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in AD30 by 16⁰, multiply the second to last digit in AD30 by 16¹, multiply the third to last digit in AD30 by 16², multiply the fourth to last digit in AD30 by 16³, and so on, until all the digits are used.
0 × 16⁰ = 0
3 × 16¹ = 48
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:
0 + 48 + 3328 + 40960 = 44336
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.
44336 ÷ 2 = 22168 with 0 remainder
22168 ÷ 2 = 11084 with 0 remainder
11084 ÷ 2 = 5542 with 0 remainder
5542 ÷ 2 = 2771 with 0 remainder
2771 ÷ 2 = 1385 with 1 remainder
1385 ÷ 2 = 692 with 1 remainder
692 ÷ 2 = 346 with 0 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 AD30 hexadecimal to binary:
AD30 hexadecimal = 1010110100110000 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
AD31 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
