
Here we will show you how to convert the hexadecimal number BD0B 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 BD0B from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in BD0B by 16⁰, multiply the second to last digit in BD0B by 16¹, multiply the third to last digit in BD0B by 16², multiply the fourth to last digit in BD0B by 16³, and so on, until all the digits are used.
B × 16⁰ = 11
0 × 16¹ = 0
D × 16² = 3328
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:
11 + 0 + 3328 + 45056 = 48395
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.
48395 ÷ 2 = 24197 with 1 remainder
24197 ÷ 2 = 12098 with 1 remainder
12098 ÷ 2 = 6049 with 0 remainder
6049 ÷ 2 = 3024 with 1 remainder
3024 ÷ 2 = 1512 with 0 remainder
1512 ÷ 2 = 756 with 0 remainder
756 ÷ 2 = 378 with 0 remainder
378 ÷ 2 = 189 with 0 remainder
189 ÷ 2 = 94 with 1 remainder
94 ÷ 2 = 47 with 0 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 BD0B hexadecimal to binary:
BD0B hexadecimal = 1011110100001011 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
BD0C hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
