
Here we will show you how to convert the hexadecimal number B66A 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 B66A from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in B66A by 16⁰, multiply the second to last digit in B66A by 16¹, multiply the third to last digit in B66A by 16², multiply the fourth to last digit in B66A by 16³, and so on, until all the digits are used.
A × 16⁰ = 10
6 × 16¹ = 96
6 × 16² = 1536
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:
10 + 96 + 1536 + 45056 = 46698
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.
46698 ÷ 2 = 23349 with 0 remainder
23349 ÷ 2 = 11674 with 1 remainder
11674 ÷ 2 = 5837 with 0 remainder
5837 ÷ 2 = 2918 with 1 remainder
2918 ÷ 2 = 1459 with 0 remainder
1459 ÷ 2 = 729 with 1 remainder
729 ÷ 2 = 364 with 1 remainder
364 ÷ 2 = 182 with 0 remainder
182 ÷ 2 = 91 with 0 remainder
91 ÷ 2 = 45 with 1 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 B66A hexadecimal to binary:
B66A hexadecimal = 1011011001101010 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
B66B hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
