
Here we will show you how to convert the hexadecimal number E4E2 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 E4E2 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in E4E2 by 16⁰, multiply the second to last digit in E4E2 by 16¹, multiply the third to last digit in E4E2 by 16², multiply the fourth to last digit in E4E2 by 16³, and so on, until all the digits are used.
2 × 16⁰ = 2
E × 16¹ = 224
4 × 16² = 1024
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:
2 + 224 + 1024 + 57344 = 58594
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.
58594 ÷ 2 = 29297 with 0 remainder
29297 ÷ 2 = 14648 with 1 remainder
14648 ÷ 2 = 7324 with 0 remainder
7324 ÷ 2 = 3662 with 0 remainder
3662 ÷ 2 = 1831 with 0 remainder
1831 ÷ 2 = 915 with 1 remainder
915 ÷ 2 = 457 with 1 remainder
457 ÷ 2 = 228 with 1 remainder
228 ÷ 2 = 114 with 0 remainder
114 ÷ 2 = 57 with 0 remainder
57 ÷ 2 = 28 with 1 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 E4E2 hexadecimal to binary:
E4E2 hexadecimal = 1110010011100010 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
E4E3 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
