
Here we will show you how to convert the hexadecimal number FE53 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 FE53 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in FE53 by 16⁰, multiply the second to last digit in FE53 by 16¹, multiply the third to last digit in FE53 by 16², multiply the fourth to last digit in FE53 by 16³, and so on, until all the digits are used.
3 × 16⁰ = 3
5 × 16¹ = 80
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:
3 + 80 + 3584 + 61440 = 65107
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.
65107 ÷ 2 = 32553 with 1 remainder
32553 ÷ 2 = 16276 with 1 remainder
16276 ÷ 2 = 8138 with 0 remainder
8138 ÷ 2 = 4069 with 0 remainder
4069 ÷ 2 = 2034 with 1 remainder
2034 ÷ 2 = 1017 with 0 remainder
1017 ÷ 2 = 508 with 1 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 FE53 hexadecimal to binary:
FE53 hexadecimal = 1111111001010011 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
FE54 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact