
Here we will show you how to convert the hexadecimal number AFAD 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 AFAD from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in AFAD by 16⁰, multiply the second to last digit in AFAD by 16¹, multiply the third to last digit in AFAD by 16², multiply the fourth to last digit in AFAD by 16³, and so on, until all the digits are used.
D × 16⁰ = 13
A × 16¹ = 160
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:
13 + 160 + 3840 + 40960 = 44973
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.
44973 ÷ 2 = 22486 with 1 remainder
22486 ÷ 2 = 11243 with 0 remainder
11243 ÷ 2 = 5621 with 1 remainder
5621 ÷ 2 = 2810 with 1 remainder
2810 ÷ 2 = 1405 with 0 remainder
1405 ÷ 2 = 702 with 1 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 AFAD hexadecimal to binary:
AFAD hexadecimal = 1010111110101101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
AFAE hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact