Convert 842 019 129 to a signed binary in two's complement representation, from a signed integer number in base 10 decimal system

842 019 129(10) to a signed binary two's complement representation = ?

1. 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;
  • 842 019 129 ÷ 2 = 421 009 564 + 1;
  • 421 009 564 ÷ 2 = 210 504 782 + 0;
  • 210 504 782 ÷ 2 = 105 252 391 + 0;
  • 105 252 391 ÷ 2 = 52 626 195 + 1;
  • 52 626 195 ÷ 2 = 26 313 097 + 1;
  • 26 313 097 ÷ 2 = 13 156 548 + 1;
  • 13 156 548 ÷ 2 = 6 578 274 + 0;
  • 6 578 274 ÷ 2 = 3 289 137 + 0;
  • 3 289 137 ÷ 2 = 1 644 568 + 1;
  • 1 644 568 ÷ 2 = 822 284 + 0;
  • 822 284 ÷ 2 = 411 142 + 0;
  • 411 142 ÷ 2 = 205 571 + 0;
  • 205 571 ÷ 2 = 102 785 + 1;
  • 102 785 ÷ 2 = 51 392 + 1;
  • 51 392 ÷ 2 = 25 696 + 0;
  • 25 696 ÷ 2 = 12 848 + 0;
  • 12 848 ÷ 2 = 6 424 + 0;
  • 6 424 ÷ 2 = 3 212 + 0;
  • 3 212 ÷ 2 = 1 606 + 0;
  • 1 606 ÷ 2 = 803 + 0;
  • 803 ÷ 2 = 401 + 1;
  • 401 ÷ 2 = 200 + 1;
  • 200 ÷ 2 = 100 + 0;
  • 100 ÷ 2 = 50 + 0;
  • 50 ÷ 2 = 25 + 0;
  • 25 ÷ 2 = 12 + 1;
  • 12 ÷ 2 = 6 + 0;
  • 6 ÷ 2 = 3 + 0;
  • 3 ÷ 2 = 1 + 1;
  • 1 ÷ 2 = 0 + 1;

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

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

842 019 129(10) = 11 0010 0011 0000 0011 0001 0011 1001(2)


3. 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.


4. 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:

842 019 129(10) = 0011 0010 0011 0000 0011 0001 0011 1001


Number 842 019 129, a signed integer, converted from decimal system (base 10) to a signed binary two's complement representation:

842 019 129(10) = 0011 0010 0011 0000 0011 0001 0011 1001

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


More operations of this kind:

842 019 128 = ? | 842 019 130 = ?


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

842,019,129 to signed binary two's complement = ? Sep 20 02:58 UTC (GMT)
4,078,673 to signed binary two's complement = ? Sep 20 02:58 UTC (GMT)
-2,147,164,131 to signed binary two's complement = ? Sep 20 02:57 UTC (GMT)
281,479,278,821,377 to signed binary two's complement = ? Sep 20 02:56 UTC (GMT)
11,109,978 to signed binary two's complement = ? Sep 20 02:56 UTC (GMT)
-628,058 to signed binary two's complement = ? Sep 20 02:55 UTC (GMT)
4,710 to signed binary two's complement = ? Sep 20 02:55 UTC (GMT)
-119,032 to signed binary two's complement = ? Sep 20 02:55 UTC (GMT)
-13,859 to signed binary two's complement = ? Sep 20 02:54 UTC (GMT)
4,828 to signed binary two's complement = ? Sep 20 02:54 UTC (GMT)
-53 to signed binary two's complement = ? Sep 20 02:54 UTC (GMT)
-15,925 to signed binary two's complement = ? Sep 20 02:54 UTC (GMT)
696,569,654,146 to signed binary two's complement = ? Sep 20 02:53 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