
Here we will show you how to convert the hexadecimal number BE8F 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 BE8F from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in BE8F by 16⁰, multiply the second to last digit in BE8F by 16¹, multiply the third to last digit in BE8F by 16², multiply the fourth to last digit in BE8F by 16³, and so on, until all the digits are used.
F × 16⁰ = 15
8 × 16¹ = 128
E × 16² = 3584
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 + 128 + 3584 + 45056 = 48783
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.
48783 ÷ 2 = 24391 with 1 remainder
24391 ÷ 2 = 12195 with 1 remainder
12195 ÷ 2 = 6097 with 1 remainder
6097 ÷ 2 = 3048 with 1 remainder
3048 ÷ 2 = 1524 with 0 remainder
1524 ÷ 2 = 762 with 0 remainder
762 ÷ 2 = 381 with 0 remainder
381 ÷ 2 = 190 with 1 remainder
190 ÷ 2 = 95 with 0 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 BE8F hexadecimal to binary:
BE8F hexadecimal = 1011111010001111 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
BE90 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
