One's Complement: Integer ↗ Binary: -987 654 297 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 -987 654 297(10) converted and written as a signed binary in one's complement representation (base 2) = ?

1. Start with the positive version of the number:

|-987 654 297| = 987 654 297

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;
  • 987 654 297 ÷ 2 = 493 827 148 + 1;
  • 493 827 148 ÷ 2 = 246 913 574 + 0;
  • 246 913 574 ÷ 2 = 123 456 787 + 0;
  • 123 456 787 ÷ 2 = 61 728 393 + 1;
  • 61 728 393 ÷ 2 = 30 864 196 + 1;
  • 30 864 196 ÷ 2 = 15 432 098 + 0;
  • 15 432 098 ÷ 2 = 7 716 049 + 0;
  • 7 716 049 ÷ 2 = 3 858 024 + 1;
  • 3 858 024 ÷ 2 = 1 929 012 + 0;
  • 1 929 012 ÷ 2 = 964 506 + 0;
  • 964 506 ÷ 2 = 482 253 + 0;
  • 482 253 ÷ 2 = 241 126 + 1;
  • 241 126 ÷ 2 = 120 563 + 0;
  • 120 563 ÷ 2 = 60 281 + 1;
  • 60 281 ÷ 2 = 30 140 + 1;
  • 30 140 ÷ 2 = 15 070 + 0;
  • 15 070 ÷ 2 = 7 535 + 0;
  • 7 535 ÷ 2 = 3 767 + 1;
  • 3 767 ÷ 2 = 1 883 + 1;
  • 1 883 ÷ 2 = 941 + 1;
  • 941 ÷ 2 = 470 + 1;
  • 470 ÷ 2 = 235 + 0;
  • 235 ÷ 2 = 117 + 1;
  • 117 ÷ 2 = 58 + 1;
  • 58 ÷ 2 = 29 + 0;
  • 29 ÷ 2 = 14 + 1;
  • 14 ÷ 2 = 7 + 0;
  • 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.


987 654 297(10) = 11 1010 1101 1110 0110 1000 1001 1001(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; ...

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, 30,

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.


987 654 297(10) = 0011 1010 1101 1110 0110 1000 1001 1001


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.

-987 654 297(10) = !(0011 1010 1101 1110 0110 1000 1001 1001)


Number -987 654 297(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:

-987 654 297(10) = 1100 0101 0010 0001 1001 0111 0110 0110

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 -987 654 298 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 -987 654 296 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 -33,456,452 as a signed binary written in one's complement representation May 20 02:09 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 1,431,586,158 as a signed binary written in one's complement representation May 20 02:09 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 21,474,854 as a signed binary written in one's complement representation May 20 02:08 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 10,011,111,001,066 as a signed binary written in one's complement representation May 20 02:08 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 1,012,027 as a signed binary written in one's complement representation May 20 02:08 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -3,148 as a signed binary written in one's complement representation May 20 02:08 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 63 as a signed binary written in one's complement representation May 20 02:08 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 26,897 as a signed binary written in one's complement representation May 20 02:08 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -48,861 as a signed binary written in one's complement representation May 20 02:06 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 774 as a signed binary written in one's complement representation May 20 02:03 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