
Here we will show you how to convert the hexadecimal number F52F 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 F52F from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in F52F by 16⁰, multiply the second to last digit in F52F by 16¹, multiply the third to last digit in F52F by 16², multiply the fourth to last digit in F52F by 16³, and so on, until all the digits are used.
F × 16⁰ = 15
2 × 16¹ = 32
5 × 16² = 1280
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:
15 + 32 + 1280 + 61440 = 62767
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.
62767 ÷ 2 = 31383 with 1 remainder
31383 ÷ 2 = 15691 with 1 remainder
15691 ÷ 2 = 7845 with 1 remainder
7845 ÷ 2 = 3922 with 1 remainder
3922 ÷ 2 = 1961 with 0 remainder
1961 ÷ 2 = 980 with 1 remainder
980 ÷ 2 = 490 with 0 remainder
490 ÷ 2 = 245 with 0 remainder
245 ÷ 2 = 122 with 1 remainder
122 ÷ 2 = 61 with 0 remainder
61 ÷ 2 = 30 with 1 remainder
30 ÷ 2 = 15 with 0 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 F52F hexadecimal to binary:
F52F hexadecimal = 1111010100101111 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
F530 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
