
Here we will show you how to convert the hexadecimal number AF8C 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 AF8C from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in AF8C by 16⁰, multiply the second to last digit in AF8C by 16¹, multiply the third to last digit in AF8C by 16², multiply the fourth to last digit in AF8C by 16³, and so on, until all the digits are used.
C × 16⁰ = 12
8 × 16¹ = 128
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:
12 + 128 + 3840 + 40960 = 44940
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.
44940 ÷ 2 = 22470 with 0 remainder
22470 ÷ 2 = 11235 with 0 remainder
11235 ÷ 2 = 5617 with 1 remainder
5617 ÷ 2 = 2808 with 1 remainder
2808 ÷ 2 = 1404 with 0 remainder
1404 ÷ 2 = 702 with 0 remainder
702 ÷ 2 = 351 with 0 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 AF8C hexadecimal to binary:
AF8C hexadecimal = 1010111110001100 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
AF8D hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact