
Here we will show you how to convert the hexadecimal number B31F 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 B31F from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in B31F by 16⁰, multiply the second to last digit in B31F by 16¹, multiply the third to last digit in B31F by 16², multiply the fourth to last digit in B31F by 16³, and so on, until all the digits are used.
F × 16⁰ = 15
1 × 16¹ = 16
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:
15 + 16 + 768 + 45056 = 45855
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.
45855 ÷ 2 = 22927 with 1 remainder
22927 ÷ 2 = 11463 with 1 remainder
11463 ÷ 2 = 5731 with 1 remainder
5731 ÷ 2 = 2865 with 1 remainder
2865 ÷ 2 = 1432 with 1 remainder
1432 ÷ 2 = 716 with 0 remainder
716 ÷ 2 = 358 with 0 remainder
358 ÷ 2 = 179 with 0 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 B31F hexadecimal to binary:
B31F hexadecimal = 1011001100011111 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
B320 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact