
Here we will show you how to convert the hexadecimal number 8AEF 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 8AEF from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in 8AEF by 16⁰, multiply the second to last digit in 8AEF by 16¹, multiply the third to last digit in 8AEF by 16², multiply the fourth to last digit in 8AEF by 16³, and so on, until all the digits are used.
F × 16⁰ = 15
E × 16¹ = 224
A × 16² = 2560
8 × 16³ = 32768
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:
15 + 224 + 2560 + 32768 = 35567
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.
35567 ÷ 2 = 17783 with 1 remainder
17783 ÷ 2 = 8891 with 1 remainder
8891 ÷ 2 = 4445 with 1 remainder
4445 ÷ 2 = 2222 with 1 remainder
2222 ÷ 2 = 1111 with 0 remainder
1111 ÷ 2 = 555 with 1 remainder
555 ÷ 2 = 277 with 1 remainder
277 ÷ 2 = 138 with 1 remainder
138 ÷ 2 = 69 with 0 remainder
69 ÷ 2 = 34 with 1 remainder
34 ÷ 2 = 17 with 0 remainder
17 ÷ 2 = 8 with 1 remainder
8 ÷ 2 = 4 with 0 remainder
4 ÷ 2 = 2 with 0 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 8AEF hexadecimal to binary:
8AEF hexadecimal = 1000101011101111 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
8AF0 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
