
Here we will show you how to convert the hexadecimal number BFCD 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 BFCD from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in BFCD by 16⁰, multiply the second to last digit in BFCD by 16¹, multiply the third to last digit in BFCD by 16², multiply the fourth to last digit in BFCD by 16³, and so on, until all the digits are used.
D × 16⁰ = 13
C × 16¹ = 192
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 + 192 + 3840 + 45056 = 49101
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.
49101 ÷ 2 = 24550 with 1 remainder
24550 ÷ 2 = 12275 with 0 remainder
12275 ÷ 2 = 6137 with 1 remainder
6137 ÷ 2 = 3068 with 1 remainder
3068 ÷ 2 = 1534 with 0 remainder
1534 ÷ 2 = 767 with 0 remainder
767 ÷ 2 = 383 with 1 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 BFCD hexadecimal to binary:
BFCD hexadecimal = 1011111111001101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
BFCE hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
