5073 hexadecimal to binary




Here we will show you how to convert the hexadecimal number 5073 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 5073 from hexadecimal to binary are explained below.

Step 1)
Multiply the last digit in 5073 by 16⁰, multiply the second to last digit in 5073 by 16¹, multiply the third to last digit in 5073 by 16², multiply the fourth to last digit in 5073 by 16³, and so on, until all the digits are used.

3 × 16⁰ = 3
7 × 16¹ = 112
0 × 16² = 0
5 × 16³ = 20480

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 + 112 + 0 + 20480 = 20595

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.

20595 ÷ 2 = 10297 with 1 remainder
10297 ÷ 2 = 5148 with 1 remainder
5148 ÷ 2 = 2574 with 0 remainder
2574 ÷ 2 = 1287 with 0 remainder
1287 ÷ 2 = 643 with 1 remainder
643 ÷ 2 = 321 with 1 remainder
321 ÷ 2 = 160 with 1 remainder
160 ÷ 2 = 80 with 0 remainder
80 ÷ 2 = 40 with 0 remainder
40 ÷ 2 = 20 with 0 remainder
20 ÷ 2 = 10 with 0 remainder
10 ÷ 2 = 5 with 0 remainder
5 ÷ 2 = 2 with 1 remainder
2 ÷ 2 = 1 with 0 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 5073 hexadecimal to binary:

5073 hexadecimal = 101000001110011 binary


Hexadecimal to Binary Converter
Here you can convert another hexadecimal number to binary.



5074 hexadecimal to binary
Go here for the next hexadecimal number on our list that we have converted to binary.



Copyright  |   Privacy Policy  |   Disclaimer  |   Contact