One's Complement: Integer ↗ Binary: -2 147 221 290 Convert the Integer Number to a Signed Binary in One's Complement Representation. Write the Base Ten Decimal System Number as a Binary Code (Written in Base Two)

Signed integer number -2 147 221 290(10) converted and written as a signed binary in one's complement representation (base 2) = ?

1. Start with the positive version of the number:

|-2 147 221 290| = 2 147 221 290

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;
  • 2 147 221 290 ÷ 2 = 1 073 610 645 + 0;
  • 1 073 610 645 ÷ 2 = 536 805 322 + 1;
  • 536 805 322 ÷ 2 = 268 402 661 + 0;
  • 268 402 661 ÷ 2 = 134 201 330 + 1;
  • 134 201 330 ÷ 2 = 67 100 665 + 0;
  • 67 100 665 ÷ 2 = 33 550 332 + 1;
  • 33 550 332 ÷ 2 = 16 775 166 + 0;
  • 16 775 166 ÷ 2 = 8 387 583 + 0;
  • 8 387 583 ÷ 2 = 4 193 791 + 1;
  • 4 193 791 ÷ 2 = 2 096 895 + 1;
  • 2 096 895 ÷ 2 = 1 048 447 + 1;
  • 1 048 447 ÷ 2 = 524 223 + 1;
  • 524 223 ÷ 2 = 262 111 + 1;
  • 262 111 ÷ 2 = 131 055 + 1;
  • 131 055 ÷ 2 = 65 527 + 1;
  • 65 527 ÷ 2 = 32 763 + 1;
  • 32 763 ÷ 2 = 16 381 + 1;
  • 16 381 ÷ 2 = 8 190 + 1;
  • 8 190 ÷ 2 = 4 095 + 0;
  • 4 095 ÷ 2 = 2 047 + 1;
  • 2 047 ÷ 2 = 1 023 + 1;
  • 1 023 ÷ 2 = 511 + 1;
  • 511 ÷ 2 = 255 + 1;
  • 255 ÷ 2 = 127 + 1;
  • 127 ÷ 2 = 63 + 1;
  • 63 ÷ 2 = 31 + 1;
  • 31 ÷ 2 = 15 + 1;
  • 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:

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


2 147 221 290(10) = 111 1111 1111 1011 1111 1111 0010 1010(2)


4. Determine the signed binary number bit length:

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

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

The first bit (the leftmost) indicates the sign:

0 = positive integer number, 1 = negative integer number


The least number that is:

1) a power of 2

2) and is larger than the actual length, 31,

3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)

=== is: 32.


5. Get the 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.


2 147 221 290(10) = 0111 1111 1111 1011 1111 1111 0010 1010


6. Get the negative integer number representation:

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

as a signed binary in one's complement representation,

... replace all the bits on 0 with 1s and all the bits set on 1 with 0s.


Reverse the digits, flip the digits:

Replace the bits set on 0 with 1s and the bits set on 1 with 0s.

-2 147 221 290(10) = !(0111 1111 1111 1011 1111 1111 0010 1010)


Number -2 147 221 290(10), a signed integer number (with sign), converted from decimal system (from base 10) and written as a signed binary in one's complement representation:

-2 147 221 290(10) = 1000 0000 0000 0100 0000 0000 1101 0101

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

More operations on signed integers written as signed binary numbers in one's complement representation:

» Signed integer number -2 147 221 291 converted from decimal system (from base 10) and written as a signed binary in one's complement representation (written in base 2) = ?

» Signed integer number -2 147 221 289 converted from decimal system (from base 10) and written as a signed binary in one's complement representation (written in base 2) = ?

The latest signed integer numbers converted from decimal system (base ten) and written as signed binary in one's complement representation

Convert and write the decimal system (base 10) signed integer number -50,054 as a signed binary written in one's complement representation May 21 00:00 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 100,159 as a signed binary written in one's complement representation May 20 23:59 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 25,578 as a signed binary written in one's complement representation May 20 23:59 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -33,022 as a signed binary written in one's complement representation May 20 23:58 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -174 as a signed binary written in one's complement representation May 20 23:57 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -1,010,100,973 as a signed binary written in one's complement representation May 20 23:56 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 1,000,125 as a signed binary written in one's complement representation May 20 23:55 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 111,110,920 as a signed binary written in one's complement representation May 20 23:55 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 43 as a signed binary written in one's complement representation May 20 23:54 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 647,782,394,680 as a signed binary written in one's complement representation May 20 23:54 UTC (GMT)
All the decimal integer numbers converted and written as signed binary numbers in one's complement representation

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

Follow the steps below to convert a signed base 10 integer number to signed binary in one'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 that is to be converted to binary, keeping track of each remainder, until we get a quotient that is equal to 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, fill in '0' bits in front (to the left) of the base 2 number calculated above, up to the right length; this way the first bit (leftmost) will always 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 '1's and all '1' bits with '0's.

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

  • 1. Start with the positive version of the number: |-49| = 49
  • 2. Divide repeatedly 49 by 2, keeping track of each remainder:
    • division = quotient + remainder
    • 49 ÷ 2 = 24 + 1
    • 24 ÷ 2 = 12 + 0
    • 12 ÷ 2 = 6 + 0
    • 6 ÷ 2 = 3 + 0
    • 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:
    49(10) = 11 0001(2)
  • 4. The actual bit length of base 2 representation is 6, so the positive binary computer representation of a signed binary will take in this case 8 bits (the least power of 2 that is larger than 6) - add '0's in front of the base 2 number, up to the required length:
    49(10) = 0011 0001(2)
  • 5. To get the negative integer number representation in signed binary one's complement, replace all '0' bits with '1's and all '1' bits with '0's:
    -49(10) = 1100 1110
  • Number -49(10), signed integer, converted from the decimal system (base 10) to signed binary in one's complement representation = 1100 1110