
Here we will show you how to convert the hexadecimal number F474 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 F474 from hexadecimal to binary are explained below.
Step 1)
Multiply the last digit in F474 by 16⁰, multiply the second to last digit in F474 by 16¹, multiply the third to last digit in F474 by 16², multiply the fourth to last digit in F474 by 16³, and so on, until all the digits are used.
4 × 16⁰ = 4
7 × 16¹ = 112
4 × 16² = 1024
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:
4 + 112 + 1024 + 61440 = 62580
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.
62580 ÷ 2 = 31290 with 0 remainder
31290 ÷ 2 = 15645 with 0 remainder
15645 ÷ 2 = 7822 with 1 remainder
7822 ÷ 2 = 3911 with 0 remainder
3911 ÷ 2 = 1955 with 1 remainder
1955 ÷ 2 = 977 with 1 remainder
977 ÷ 2 = 488 with 1 remainder
488 ÷ 2 = 244 with 0 remainder
244 ÷ 2 = 122 with 0 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 F474 hexadecimal to binary:
F474 hexadecimal = 1111010001110100 binary
Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.
F475 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.
Copyright | Privacy Policy | Disclaimer | Contact
