
Here we will show you how to convert the hexadecimal number E211 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 E211 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in E211 by 16⁰, multiply the second to last digit in E211 by 16¹, multiply the third to last digit in E211 by 16², multiply the fourth to last digit in E211 by 16³, and so on, until all the digits are used.
1 × 16⁰ = 1
1 × 16¹ = 16
2 × 16² = 512
E × 16³ = 57344
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 + 512 + 57344 = 57873
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.
57873 ÷ 2 = 28936 with 1 remainder
28936 ÷ 2 = 14468 with 0 remainder
14468 ÷ 2 = 7234 with 0 remainder
7234 ÷ 2 = 3617 with 0 remainder
3617 ÷ 2 = 1808 with 1 remainder
1808 ÷ 2 = 904 with 0 remainder
904 ÷ 2 = 452 with 0 remainder
452 ÷ 2 = 226 with 0 remainder
226 ÷ 2 = 113 with 0 remainder
113 ÷ 2 = 56 with 1 remainder
56 ÷ 2 = 28 with 0 remainder
28 ÷ 2 = 14 with 0 remainder
14 ÷ 2 = 7 with 0 remainder
7 ÷ 2 = 3 with 1 remainder
3 ÷ 2 = 1 with 1 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 E211 hexadecimal to binary:
E211 hexadecimal = 1110001000010001 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
E212 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact