Integer to One's Complement Binary: Number -2 146 959 288 Converted and Written as a Signed Binary in One's Complement Representation

Integer number -2 146 959 288(10) written as a signed binary in one's complement representation

1. Start with the positive version of the number:

|-2 146 959 288| = 2 146 959 288

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 146 959 288 ÷ 2 = 1 073 479 644 + 0;
  • 1 073 479 644 ÷ 2 = 536 739 822 + 0;
  • 536 739 822 ÷ 2 = 268 369 911 + 0;
  • 268 369 911 ÷ 2 = 134 184 955 + 1;
  • 134 184 955 ÷ 2 = 67 092 477 + 1;
  • 67 092 477 ÷ 2 = 33 546 238 + 1;
  • 33 546 238 ÷ 2 = 16 773 119 + 0;
  • 16 773 119 ÷ 2 = 8 386 559 + 1;
  • 8 386 559 ÷ 2 = 4 193 279 + 1;
  • 4 193 279 ÷ 2 = 2 096 639 + 1;
  • 2 096 639 ÷ 2 = 1 048 319 + 1;
  • 1 048 319 ÷ 2 = 524 159 + 1;
  • 524 159 ÷ 2 = 262 079 + 1;
  • 262 079 ÷ 2 = 131 039 + 1;
  • 131 039 ÷ 2 = 65 519 + 1;
  • 65 519 ÷ 2 = 32 759 + 1;
  • 32 759 ÷ 2 = 16 379 + 1;
  • 16 379 ÷ 2 = 8 189 + 1;
  • 8 189 ÷ 2 = 4 094 + 1;
  • 4 094 ÷ 2 = 2 047 + 0;
  • 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 146 959 288(10) = 111 1111 1111 0111 1111 1111 1011 1000(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 146 959 288(10) = 0111 1111 1111 0111 1111 1111 1011 1000

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 146 959 288(10) = !(0111 1111 1111 0111 1111 1111 1011 1000)


Number -2 146 959 288(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 146 959 288(10) = 1000 0000 0000 1000 0000 0000 0100 0111

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

» More ops: Integer number -2 146 959 311 converted and written as a signed binary in one's complement representation

» New: All the Calculations Performed by Our Visitors: Integer numbers converted and written as signed binary in one's complement representation. Data organized on a Monthly Basis

» Month 01, 2025 [January]: Integer Numbers Converted and Written as Signed Binary in One's Complement Representation. Monthly Calculations performed during the month of: January - by our visitors

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