
Here we will show you how to convert the hexadecimal number E2FA 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 E2FA from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in E2FA by 16⁰, multiply the second to last digit in E2FA by 16¹, multiply the third to last digit in E2FA by 16², multiply the fourth to last digit in E2FA by 16³, and so on, until all the digits are used.
A × 16⁰ = 10
F × 16¹ = 240
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:
10 + 240 + 512 + 57344 = 58106
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.
58106 ÷ 2 = 29053 with 0 remainder
29053 ÷ 2 = 14526 with 1 remainder
14526 ÷ 2 = 7263 with 0 remainder
7263 ÷ 2 = 3631 with 1 remainder
3631 ÷ 2 = 1815 with 1 remainder
1815 ÷ 2 = 907 with 1 remainder
907 ÷ 2 = 453 with 1 remainder
453 ÷ 2 = 226 with 1 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 E2FA hexadecimal to binary:
E2FA hexadecimal = 1110001011111010 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
E2FB hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
