
Here we will show you how to convert the hexadecimal number AFEF 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 AFEF from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in AFEF by 16⁰, multiply the second to last digit in AFEF by 16¹, multiply the third to last digit in AFEF by 16², multiply the fourth to last digit in AFEF by 16³, and so on, until all the digits are used.
F × 16⁰ = 15
E × 16¹ = 224
F × 16² = 3840
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:
15 + 224 + 3840 + 40960 = 45039
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.
45039 ÷ 2 = 22519 with 1 remainder
22519 ÷ 2 = 11259 with 1 remainder
11259 ÷ 2 = 5629 with 1 remainder
5629 ÷ 2 = 2814 with 1 remainder
2814 ÷ 2 = 1407 with 0 remainder
1407 ÷ 2 = 703 with 1 remainder
703 ÷ 2 = 351 with 1 remainder
351 ÷ 2 = 175 with 1 remainder
175 ÷ 2 = 87 with 1 remainder
87 ÷ 2 = 43 with 1 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 AFEF hexadecimal to binary:
AFEF hexadecimal = 1010111111101111 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
AFF0 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact