
Here we will show you how to convert the hexadecimal number B87D 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 B87D from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in B87D by 16⁰, multiply the second to last digit in B87D by 16¹, multiply the third to last digit in B87D by 16², multiply the fourth to last digit in B87D by 16³, and so on, until all the digits are used.
D × 16⁰ = 13
7 × 16¹ = 112
8 × 16² = 2048
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 + 112 + 2048 + 45056 = 47229
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.
47229 ÷ 2 = 23614 with 1 remainder
23614 ÷ 2 = 11807 with 0 remainder
11807 ÷ 2 = 5903 with 1 remainder
5903 ÷ 2 = 2951 with 1 remainder
2951 ÷ 2 = 1475 with 1 remainder
1475 ÷ 2 = 737 with 1 remainder
737 ÷ 2 = 368 with 1 remainder
368 ÷ 2 = 184 with 0 remainder
184 ÷ 2 = 92 with 0 remainder
92 ÷ 2 = 46 with 0 remainder
46 ÷ 2 = 23 with 0 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 B87D hexadecimal to binary:
B87D hexadecimal = 1011100001111101 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
B87E hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
