One's Complement: Integer ↗ Binary: 111 000 011 107 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 000 011 107(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 000 011 107 ÷ 2 = 55 500 005 553 + 1;
  • 55 500 005 553 ÷ 2 = 27 750 002 776 + 1;
  • 27 750 002 776 ÷ 2 = 13 875 001 388 + 0;
  • 13 875 001 388 ÷ 2 = 6 937 500 694 + 0;
  • 6 937 500 694 ÷ 2 = 3 468 750 347 + 0;
  • 3 468 750 347 ÷ 2 = 1 734 375 173 + 1;
  • 1 734 375 173 ÷ 2 = 867 187 586 + 1;
  • 867 187 586 ÷ 2 = 433 593 793 + 0;
  • 433 593 793 ÷ 2 = 216 796 896 + 1;
  • 216 796 896 ÷ 2 = 108 398 448 + 0;
  • 108 398 448 ÷ 2 = 54 199 224 + 0;
  • 54 199 224 ÷ 2 = 27 099 612 + 0;
  • 27 099 612 ÷ 2 = 13 549 806 + 0;
  • 13 549 806 ÷ 2 = 6 774 903 + 0;
  • 6 774 903 ÷ 2 = 3 387 451 + 1;
  • 3 387 451 ÷ 2 = 1 693 725 + 1;
  • 1 693 725 ÷ 2 = 846 862 + 1;
  • 846 862 ÷ 2 = 423 431 + 0;
  • 423 431 ÷ 2 = 211 715 + 1;
  • 211 715 ÷ 2 = 105 857 + 1;
  • 105 857 ÷ 2 = 52 928 + 1;
  • 52 928 ÷ 2 = 26 464 + 0;
  • 26 464 ÷ 2 = 13 232 + 0;
  • 13 232 ÷ 2 = 6 616 + 0;
  • 6 616 ÷ 2 = 3 308 + 0;
  • 3 308 ÷ 2 = 1 654 + 0;
  • 1 654 ÷ 2 = 827 + 0;
  • 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 000 011 107(10) = 1 1001 1101 1000 0001 1101 1100 0001 0110 0011(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 000 011 107(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 000 011 107(10) = 0000 0000 0000 0000 0000 0000 0001 1001 1101 1000 0001 1101 1100 0001 0110 0011

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 000 011 106 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 000 011 108 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 85,084,069,208 as a signed binary written in one's complement representation May 19 01:05 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -1,497 as a signed binary written in one's complement representation May 19 01:03 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 22 as a signed binary written in one's complement representation May 19 01:03 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -2,147,367,010 as a signed binary written in one's complement representation May 19 01:02 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 3,918 as a signed binary written in one's complement representation May 19 01:02 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 11,000,011,186 as a signed binary written in one's complement representation May 19 01:00 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 1,011,200 as a signed binary written in one's complement representation May 19 01:00 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 9,223,372,036,854,775,801 as a signed binary written in one's complement representation May 19 00:58 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 1,000,000,000,000,000,006 as a signed binary written in one's complement representation May 19 00:57 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 26,720 as a signed binary written in one's complement representation May 19 00:56 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