Convert -646 135 473 to a signed binary in two's complement representation, from a signed integer number in base 10 decimal system

-646 135 473(10) to a signed binary two's complement representation = ?

1. Start with the positive version of the number:

|-646 135 473| = 646 135 473

2. Divide the number repeatedly by 2:

Keep track of each remainder.

We stop when we get a quotient that is equal to zero.

  • division = quotient + remainder;
  • 646 135 473 ÷ 2 = 323 067 736 + 1;
  • 323 067 736 ÷ 2 = 161 533 868 + 0;
  • 161 533 868 ÷ 2 = 80 766 934 + 0;
  • 80 766 934 ÷ 2 = 40 383 467 + 0;
  • 40 383 467 ÷ 2 = 20 191 733 + 1;
  • 20 191 733 ÷ 2 = 10 095 866 + 1;
  • 10 095 866 ÷ 2 = 5 047 933 + 0;
  • 5 047 933 ÷ 2 = 2 523 966 + 1;
  • 2 523 966 ÷ 2 = 1 261 983 + 0;
  • 1 261 983 ÷ 2 = 630 991 + 1;
  • 630 991 ÷ 2 = 315 495 + 1;
  • 315 495 ÷ 2 = 157 747 + 1;
  • 157 747 ÷ 2 = 78 873 + 1;
  • 78 873 ÷ 2 = 39 436 + 1;
  • 39 436 ÷ 2 = 19 718 + 0;
  • 19 718 ÷ 2 = 9 859 + 0;
  • 9 859 ÷ 2 = 4 929 + 1;
  • 4 929 ÷ 2 = 2 464 + 1;
  • 2 464 ÷ 2 = 1 232 + 0;
  • 1 232 ÷ 2 = 616 + 0;
  • 616 ÷ 2 = 308 + 0;
  • 308 ÷ 2 = 154 + 0;
  • 154 ÷ 2 = 77 + 0;
  • 77 ÷ 2 = 38 + 1;
  • 38 ÷ 2 = 19 + 0;
  • 19 ÷ 2 = 9 + 1;
  • 9 ÷ 2 = 4 + 1;
  • 4 ÷ 2 = 2 + 0;
  • 2 ÷ 2 = 1 + 0;
  • 1 ÷ 2 = 0 + 1;

3. Construct the base 2 representation of the positive number:

Take all the remainders starting from the bottom of the list constructed above.

646 135 473(10) = 10 0110 1000 0011 0011 1110 1011 0001(2)


4. Determine the signed binary number bit length:

The base 2 number's actual length, in bits: 30.

A signed binary's bit length must be equal to a power of 2, as of:
21 = 2; 22 = 4; 23 = 8; 24 = 16; 25 = 32; 26 = 64; ...

First bit (the leftmost) indicates the sign,
1 = negative, 0 = positive.

The least number that is:


a power of 2


and is larger than the actual length, 30,


so that the first bit (leftmost) could be zero


(we deal with a positive number at this moment)


is: 32.


5. Positive binary computer representation on 32 bits (4 Bytes):

If needed, add extra 0s in front (to the left) of the base 2 number, up to the required length, 32:

646 135 473(10) = 0010 0110 1000 0011 0011 1110 1011 0001


6. Get the negative integer number representation. Part 1:

To get the negative integer number representation on 32 bits (4 Bytes),


signed binary one's complement,


replace all the bits on 0 with 1s


and all the bits set on 1 with 0s


(reverse the digits, flip the digits)


!(0010 0110 1000 0011 0011 1110 1011 0001) =


1101 1001 0111 1100 1100 0001 0100 1110


7. Get the negative integer number representation. Part 2:

To get the negative integer number representation on 32 bits (4 Bytes),


signed binary two's complement,


add 1 to the number calculated above


1101 1001 0111 1100 1100 0001 0100 1110 + 1 =


1101 1001 0111 1100 1100 0001 0100 1111


Number -646 135 473, a signed integer, converted from decimal system (base 10) to a signed binary two's complement representation:

-646 135 473(10) = 1101 1001 0111 1100 1100 0001 0100 1111

Spaces used to group digits: for binary, by 4; for decimal, by 3.


More operations of this kind:

-646 135 474 = ? | -646 135 472 = ?


Convert signed integer numbers from the decimal system (base ten) to signed binary two's complement representation

How to convert a base 10 signed integer number to signed binary in two's complement representation:

1) Divide the positive version of number repeatedly by 2, keeping track of each remainder, till getting a quotient that is equal to 0.

2) Construct the base 2 representation by taking the previously calculated remainders starting from the last remainder up to the first one, in that order.

3) Construct the positive binary computer representation so that the first bit is 0.

4) Only if the initial number is negative, switch all the bits from 0 to 1 and from 1 to 0 (reversing the digits).

5) Only if the initial number is negative, add 1 to the number at the previous point.

Latest signed integers converted from decimal system to binary two's complement representation

-646,135,473 to signed binary two's complement = ? Apr 18 09:26 UTC (GMT)
250,099,737,364 to signed binary two's complement = ? Apr 18 09:26 UTC (GMT)
164,311,266,871,028 to signed binary two's complement = ? Apr 18 09:26 UTC (GMT)
42 to signed binary two's complement = ? Apr 18 09:26 UTC (GMT)
-1,551 to signed binary two's complement = ? Apr 18 09:26 UTC (GMT)
11,101,106 to signed binary two's complement = ? Apr 18 09:25 UTC (GMT)
1,036 to signed binary two's complement = ? Apr 18 09:25 UTC (GMT)
266,338,304 to signed binary two's complement = ? Apr 18 09:25 UTC (GMT)
5,237,811,932,527,789 to signed binary two's complement = ? Apr 18 09:25 UTC (GMT)
105 to signed binary two's complement = ? Apr 18 09:25 UTC (GMT)
286,779,883 to signed binary two's complement = ? Apr 18 09:25 UTC (GMT)
21,596 to signed binary two's complement = ? Apr 18 09:25 UTC (GMT)
-1,069,547,243 to signed binary two's complement = ? Apr 18 09:25 UTC (GMT)
All decimal integer numbers converted to signed binary two's complement representation

How to convert signed integers from decimal system to signed binary in two's complement representation

Follow the steps below to convert a signed base 10 integer number to signed binary in two's complement representation:

  • 1. If the number to be converted is negative, start with the positive version of the number.
  • 2. Divide repeatedly by 2 the positive representation of the integer number, keeping track of each remainder, until we get a quotient that is zero.
  • 3. Construct the base 2 representation of the positive number, by taking all the remainders starting from the bottom of the list constructed above. Thus, the last remainder of the divisions becomes the first symbol (the leftmost) of the base two number, while the first remainder becomes the last symbol (the rightmost).
  • 4. Binary numbers represented in computer language must have 4, 8, 16, 32, 64, ... bit length (a power of 2) - if needed, add extra bits on 0 in front (to the left) of the base 2 number above, up to the required length, so that the first bit (the leftmost) will be 0, correctly representing a positive number.
  • 5. To get the negative integer number representation in signed binary one's complement, replace all 0 bits with 1s and all 1 bits with 0s (reversing the digits).
  • 6. To get the negative integer number, in signed binary two's complement representation, add 1 to the number above.

Example: convert the negative number -60 from the decimal system (base ten) to signed binary in two's complement:

  • 1. Start with the positive version of the number: |-60| = 60
  • 2. Divide repeatedly 60 by 2, keeping track of each remainder:
    • division = quotient + remainder
    • 60 ÷ 2 = 30 + 0
    • 30 ÷ 2 = 15 + 0
    • 15 ÷ 2 = 7 + 1
    • 7 ÷ 2 = 3 + 1
    • 3 ÷ 2 = 1 + 1
    • 1 ÷ 2 = 0 + 1
  • 3. Construct the base 2 representation of the positive number, by taking all the remainders starting from the bottom of the list constructed above:
    60(10) = 11 1100(2)
  • 4. Bit length of base 2 representation number is 6, so the positive binary computer representation of a signed binary will take in this particular case 8 bits (the least power of 2 larger than 6) - add extra 0 digits in front of the base 2 number, up to the required length:
    60(10) = 0011 1100(2)
  • 5. To get the negative integer number representation in signed binary one's complement, replace all the 0 bits with 1s and all 1 bits with 0s (reversing the digits):
    !(0011 1100) = 1100 0011
  • 6. To get the negative integer number, signed binary in two's complement representation, add 1 to the number above:
    -60(10) = 1100 0011 + 1 = 1100 0100
  • Number -60(10), signed integer, converted from decimal system (base 10) to signed binary two's complement representation = 1100 0100