
Here we will show you how to convert the hexadecimal number B411 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 B411 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in B411 by 16⁰, multiply the second to last digit in B411 by 16¹, multiply the third to last digit in B411 by 16², multiply the fourth to last digit in B411 by 16³, and so on, until all the digits are used.
1 × 16⁰ = 1
1 × 16¹ = 16
4 × 16² = 1024
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 + 16 + 1024 + 45056 = 46097
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.
46097 ÷ 2 = 23048 with 1 remainder
23048 ÷ 2 = 11524 with 0 remainder
11524 ÷ 2 = 5762 with 0 remainder
5762 ÷ 2 = 2881 with 0 remainder
2881 ÷ 2 = 1440 with 1 remainder
1440 ÷ 2 = 720 with 0 remainder
720 ÷ 2 = 360 with 0 remainder
360 ÷ 2 = 180 with 0 remainder
180 ÷ 2 = 90 with 0 remainder
90 ÷ 2 = 45 with 0 remainder
45 ÷ 2 = 22 with 1 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 B411 hexadecimal to binary:
B411 hexadecimal = 1011010000010001 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
B412 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
