
Here we will show you how to convert the hexadecimal number E5E9 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 E5E9 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in E5E9 by 16⁰, multiply the second to last digit in E5E9 by 16¹, multiply the third to last digit in E5E9 by 16², multiply the fourth to last digit in E5E9 by 16³, and so on, until all the digits are used.
9 × 16⁰ = 9
E × 16¹ = 224
5 × 16² = 1280
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:
9 + 224 + 1280 + 57344 = 58857
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.
58857 ÷ 2 = 29428 with 1 remainder
29428 ÷ 2 = 14714 with 0 remainder
14714 ÷ 2 = 7357 with 0 remainder
7357 ÷ 2 = 3678 with 1 remainder
3678 ÷ 2 = 1839 with 0 remainder
1839 ÷ 2 = 919 with 1 remainder
919 ÷ 2 = 459 with 1 remainder
459 ÷ 2 = 229 with 1 remainder
229 ÷ 2 = 114 with 1 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 E5E9 hexadecimal to binary:
E5E9 hexadecimal = 1110010111101001 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
E5EA hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
