
Here we will show you how to convert the hexadecimal number E228 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 E228 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in E228 by 16⁰, multiply the second to last digit in E228 by 16¹, multiply the third to last digit in E228 by 16², multiply the fourth to last digit in E228 by 16³, and so on, until all the digits are used.
8 × 16⁰ = 8
2 × 16¹ = 32
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:
8 + 32 + 512 + 57344 = 57896
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.
57896 ÷ 2 = 28948 with 0 remainder
28948 ÷ 2 = 14474 with 0 remainder
14474 ÷ 2 = 7237 with 0 remainder
7237 ÷ 2 = 3618 with 1 remainder
3618 ÷ 2 = 1809 with 0 remainder
1809 ÷ 2 = 904 with 1 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 E228 hexadecimal to binary:
E228 hexadecimal = 1110001000101000 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
E229 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
