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

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;
  • 1 129 662 544 ÷ 2 = 564 831 272 + 0;
  • 564 831 272 ÷ 2 = 282 415 636 + 0;
  • 282 415 636 ÷ 2 = 141 207 818 + 0;
  • 141 207 818 ÷ 2 = 70 603 909 + 0;
  • 70 603 909 ÷ 2 = 35 301 954 + 1;
  • 35 301 954 ÷ 2 = 17 650 977 + 0;
  • 17 650 977 ÷ 2 = 8 825 488 + 1;
  • 8 825 488 ÷ 2 = 4 412 744 + 0;
  • 4 412 744 ÷ 2 = 2 206 372 + 0;
  • 2 206 372 ÷ 2 = 1 103 186 + 0;
  • 1 103 186 ÷ 2 = 551 593 + 0;
  • 551 593 ÷ 2 = 275 796 + 1;
  • 275 796 ÷ 2 = 137 898 + 0;
  • 137 898 ÷ 2 = 68 949 + 0;
  • 68 949 ÷ 2 = 34 474 + 1;
  • 34 474 ÷ 2 = 17 237 + 0;
  • 17 237 ÷ 2 = 8 618 + 1;
  • 8 618 ÷ 2 = 4 309 + 0;
  • 4 309 ÷ 2 = 2 154 + 1;
  • 2 154 ÷ 2 = 1 077 + 0;
  • 1 077 ÷ 2 = 538 + 1;
  • 538 ÷ 2 = 269 + 0;
  • 269 ÷ 2 = 134 + 1;
  • 134 ÷ 2 = 67 + 0;
  • 67 ÷ 2 = 33 + 1;
  • 33 ÷ 2 = 16 + 1;
  • 16 ÷ 2 = 8 + 0;
  • 8 ÷ 2 = 4 + 0;
  • 4 ÷ 2 = 2 + 0;
  • 2 ÷ 2 = 1 + 0;
  • 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.


1 129 662 544(10) = 100 0011 0101 0101 0100 1000 0101 0000(2)


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


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


Number 1 129 662 544(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:

1 129 662 544(10) = 0100 0011 0101 0101 0100 1000 0101 0000

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 1 129 662 543 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 1 129 662 545 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 1,000,000,100,009,869 as a signed binary written in one's complement representation May 01 17:03 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -8,558 as a signed binary written in one's complement representation May 01 17:03 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 110,120 as a signed binary written in one's complement representation May 01 17:02 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -271,017 as a signed binary written in one's complement representation May 01 17:02 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 40,019 as a signed binary written in one's complement representation May 01 17:02 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 111,101,011,188 as a signed binary written in one's complement representation May 01 17:01 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 7,999,860 as a signed binary written in one's complement representation May 01 17:00 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -51,999,999,904 as a signed binary written in one's complement representation May 01 16:59 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -7 as a signed binary written in one's complement representation May 01 16:57 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -4,384 as a signed binary written in one's complement representation May 01 16:57 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