
Here we will show you how to convert the hexadecimal number FE0E 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 FE0E from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in FE0E by 16⁰, multiply the second to last digit in FE0E by 16¹, multiply the third to last digit in FE0E by 16², multiply the fourth to last digit in FE0E by 16³, and so on, until all the digits are used.
E × 16⁰ = 14
0 × 16¹ = 0
E × 16² = 3584
F × 16³ = 61440
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:
14 + 0 + 3584 + 61440 = 65038
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.
65038 ÷ 2 = 32519 with 0 remainder
32519 ÷ 2 = 16259 with 1 remainder
16259 ÷ 2 = 8129 with 1 remainder
8129 ÷ 2 = 4064 with 1 remainder
4064 ÷ 2 = 2032 with 0 remainder
2032 ÷ 2 = 1016 with 0 remainder
1016 ÷ 2 = 508 with 0 remainder
508 ÷ 2 = 254 with 0 remainder
254 ÷ 2 = 127 with 0 remainder
127 ÷ 2 = 63 with 1 remainder
63 ÷ 2 = 31 with 1 remainder
31 ÷ 2 = 15 with 1 remainder
15 ÷ 2 = 7 with 1 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 FE0E hexadecimal to binary:
FE0E hexadecimal = 1111111000001110 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
FE0F hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact