
Here we will show you how to convert the hexadecimal number BFAD 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 BFAD from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in BFAD by 16⁰, multiply the second to last digit in BFAD by 16¹, multiply the third to last digit in BFAD by 16², multiply the fourth to last digit in BFAD by 16³, and so on, until all the digits are used.
D × 16⁰ = 13
A × 16¹ = 160
F × 16² = 3840
B × 16³ = 45056
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 + 45056 = 49069
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.
49069 ÷ 2 = 24534 with 1 remainder
24534 ÷ 2 = 12267 with 0 remainder
12267 ÷ 2 = 6133 with 1 remainder
6133 ÷ 2 = 3066 with 1 remainder
3066 ÷ 2 = 1533 with 0 remainder
1533 ÷ 2 = 766 with 1 remainder
766 ÷ 2 = 383 with 0 remainder
383 ÷ 2 = 191 with 1 remainder
191 ÷ 2 = 95 with 1 remainder
95 ÷ 2 = 47 with 1 remainder
47 ÷ 2 = 23 with 1 remainder
23 ÷ 2 = 11 with 1 remainder
11 ÷ 2 = 5 with 1 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 BFAD hexadecimal to binary:
BFAD hexadecimal = 1011111110101101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
BFAE hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
