602D hexadecimal to binary




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

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

D × 16⁰ = 13
2 × 16¹ = 32
0 × 16² = 0
6 × 16³ = 24576

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:

13 + 32 + 0 + 24576 = 24621

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.

24621 ÷ 2 = 12310 with 1 remainder
12310 ÷ 2 = 6155 with 0 remainder
6155 ÷ 2 = 3077 with 1 remainder
3077 ÷ 2 = 1538 with 1 remainder
1538 ÷ 2 = 769 with 0 remainder
769 ÷ 2 = 384 with 1 remainder
384 ÷ 2 = 192 with 0 remainder
192 ÷ 2 = 96 with 0 remainder
96 ÷ 2 = 48 with 0 remainder
48 ÷ 2 = 24 with 0 remainder
24 ÷ 2 = 12 with 0 remainder
12 ÷ 2 = 6 with 0 remainder
6 ÷ 2 = 3 with 0 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 602D hexadecimal to binary:

602D hexadecimal = 110000000101101 binary


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



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



Copyright  |   Privacy Policy  |   Disclaimer  |   Contact