
Here we will show you how to convert the hexadecimal number B3F1 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 B3F1 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in B3F1 by 16⁰, multiply the second to last digit in B3F1 by 16¹, multiply the third to last digit in B3F1 by 16², multiply the fourth to last digit in B3F1 by 16³, and so on, until all the digits are used.
1 × 16⁰ = 1
F × 16¹ = 240
3 × 16² = 768
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:
1 + 240 + 768 + 45056 = 46065
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.
46065 ÷ 2 = 23032 with 1 remainder
23032 ÷ 2 = 11516 with 0 remainder
11516 ÷ 2 = 5758 with 0 remainder
5758 ÷ 2 = 2879 with 0 remainder
2879 ÷ 2 = 1439 with 1 remainder
1439 ÷ 2 = 719 with 1 remainder
719 ÷ 2 = 359 with 1 remainder
359 ÷ 2 = 179 with 1 remainder
179 ÷ 2 = 89 with 1 remainder
89 ÷ 2 = 44 with 1 remainder
44 ÷ 2 = 22 with 0 remainder
22 ÷ 2 = 11 with 0 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 B3F1 hexadecimal to binary:
B3F1 hexadecimal = 1011001111110001 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
B3F2 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
