One's Complement: Integer ↗ Binary: 111 101 010 990 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 111 101 010 990(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;
  • 111 101 010 990 ÷ 2 = 55 550 505 495 + 0;
  • 55 550 505 495 ÷ 2 = 27 775 252 747 + 1;
  • 27 775 252 747 ÷ 2 = 13 887 626 373 + 1;
  • 13 887 626 373 ÷ 2 = 6 943 813 186 + 1;
  • 6 943 813 186 ÷ 2 = 3 471 906 593 + 0;
  • 3 471 906 593 ÷ 2 = 1 735 953 296 + 1;
  • 1 735 953 296 ÷ 2 = 867 976 648 + 0;
  • 867 976 648 ÷ 2 = 433 988 324 + 0;
  • 433 988 324 ÷ 2 = 216 994 162 + 0;
  • 216 994 162 ÷ 2 = 108 497 081 + 0;
  • 108 497 081 ÷ 2 = 54 248 540 + 1;
  • 54 248 540 ÷ 2 = 27 124 270 + 0;
  • 27 124 270 ÷ 2 = 13 562 135 + 0;
  • 13 562 135 ÷ 2 = 6 781 067 + 1;
  • 6 781 067 ÷ 2 = 3 390 533 + 1;
  • 3 390 533 ÷ 2 = 1 695 266 + 1;
  • 1 695 266 ÷ 2 = 847 633 + 0;
  • 847 633 ÷ 2 = 423 816 + 1;
  • 423 816 ÷ 2 = 211 908 + 0;
  • 211 908 ÷ 2 = 105 954 + 0;
  • 105 954 ÷ 2 = 52 977 + 0;
  • 52 977 ÷ 2 = 26 488 + 1;
  • 26 488 ÷ 2 = 13 244 + 0;
  • 13 244 ÷ 2 = 6 622 + 0;
  • 6 622 ÷ 2 = 3 311 + 0;
  • 3 311 ÷ 2 = 1 655 + 1;
  • 1 655 ÷ 2 = 827 + 1;
  • 827 ÷ 2 = 413 + 1;
  • 413 ÷ 2 = 206 + 1;
  • 206 ÷ 2 = 103 + 0;
  • 103 ÷ 2 = 51 + 1;
  • 51 ÷ 2 = 25 + 1;
  • 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.


111 101 010 990(10) = 1 1001 1101 1110 0010 0010 1110 0100 0010 1110(2)


3. Determine the signed binary number bit length:

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

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

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

=== is: 64.


4. Get the positive binary computer representation on 64 bits (8 Bytes):

If needed, add extra 0s in front (to the left) of the base 2 number, up to the required length, 64.


Number 111 101 010 990(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:

111 101 010 990(10) = 0000 0000 0000 0000 0000 0000 0001 1001 1101 1110 0010 0010 1110 0100 0010 1110

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 111 101 010 989 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 111 101 010 991 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 -39,730 as a signed binary written in one's complement representation May 18 18:37 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 100,100,219 as a signed binary written in one's complement representation May 18 18:37 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 100,011,100,986 as a signed binary written in one's complement representation May 18 18:36 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 5,138 as a signed binary written in one's complement representation May 18 18:36 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 747 as a signed binary written in one's complement representation May 18 18:35 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -130 as a signed binary written in one's complement representation May 18 18:35 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -70 as a signed binary written in one's complement representation May 18 18:34 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -83,662 as a signed binary written in one's complement representation May 18 18:33 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 19,216,811,128 as a signed binary written in one's complement representation May 18 18:32 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -727 as a signed binary written in one's complement representation May 18 18:32 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