
Here we will show you how to convert the hexadecimal number FF58 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 FF58 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in FF58 by 16⁰, multiply the second to last digit in FF58 by 16¹, multiply the third to last digit in FF58 by 16², multiply the fourth to last digit in FF58 by 16³, and so on, until all the digits are used.
8 × 16⁰ = 8
5 × 16¹ = 80
F × 16² = 3840
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:
8 + 80 + 3840 + 61440 = 65368
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.
65368 ÷ 2 = 32684 with 0 remainder
32684 ÷ 2 = 16342 with 0 remainder
16342 ÷ 2 = 8171 with 0 remainder
8171 ÷ 2 = 4085 with 1 remainder
4085 ÷ 2 = 2042 with 1 remainder
2042 ÷ 2 = 1021 with 0 remainder
1021 ÷ 2 = 510 with 1 remainder
510 ÷ 2 = 255 with 0 remainder
255 ÷ 2 = 127 with 1 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 FF58 hexadecimal to binary:
FF58 hexadecimal = 1111111101011000 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
FF59 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact