One's Complement: Integer ↗ Binary: 19 216 811 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 19 216 811 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;
  • 19 216 811 107 ÷ 2 = 9 608 405 553 + 1;
  • 9 608 405 553 ÷ 2 = 4 804 202 776 + 1;
  • 4 804 202 776 ÷ 2 = 2 402 101 388 + 0;
  • 2 402 101 388 ÷ 2 = 1 201 050 694 + 0;
  • 1 201 050 694 ÷ 2 = 600 525 347 + 0;
  • 600 525 347 ÷ 2 = 300 262 673 + 1;
  • 300 262 673 ÷ 2 = 150 131 336 + 1;
  • 150 131 336 ÷ 2 = 75 065 668 + 0;
  • 75 065 668 ÷ 2 = 37 532 834 + 0;
  • 37 532 834 ÷ 2 = 18 766 417 + 0;
  • 18 766 417 ÷ 2 = 9 383 208 + 1;
  • 9 383 208 ÷ 2 = 4 691 604 + 0;
  • 4 691 604 ÷ 2 = 2 345 802 + 0;
  • 2 345 802 ÷ 2 = 1 172 901 + 0;
  • 1 172 901 ÷ 2 = 586 450 + 1;
  • 586 450 ÷ 2 = 293 225 + 0;
  • 293 225 ÷ 2 = 146 612 + 1;
  • 146 612 ÷ 2 = 73 306 + 0;
  • 73 306 ÷ 2 = 36 653 + 0;
  • 36 653 ÷ 2 = 18 326 + 1;
  • 18 326 ÷ 2 = 9 163 + 0;
  • 9 163 ÷ 2 = 4 581 + 1;
  • 4 581 ÷ 2 = 2 290 + 1;
  • 2 290 ÷ 2 = 1 145 + 0;
  • 1 145 ÷ 2 = 572 + 1;
  • 572 ÷ 2 = 286 + 0;
  • 286 ÷ 2 = 143 + 0;
  • 143 ÷ 2 = 71 + 1;
  • 71 ÷ 2 = 35 + 1;
  • 35 ÷ 2 = 17 + 1;
  • 17 ÷ 2 = 8 + 1;
  • 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.


19 216 811 107(10) = 100 0111 1001 0110 1001 0100 0100 0110 0011(2)


3. Determine the signed binary number bit length:

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

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

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 19 216 811 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:

19 216 811 107(10) = 0000 0000 0000 0000 0000 0000 0000 0100 0111 1001 0110 1001 0100 0100 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 19 216 811 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 19 216 811 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 111,108 as a signed binary written in one's complement representation May 18 15:30 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 65,296 as a signed binary written in one's complement representation May 18 15:30 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 10,001,101 as a signed binary written in one's complement representation May 18 15:29 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 607 as a signed binary written in one's complement representation May 18 15:29 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 5,431 as a signed binary written in one's complement representation May 18 15:27 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 1,111,111,111,000,081 as a signed binary written in one's complement representation May 18 15:27 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 11,001,163 as a signed binary written in one's complement representation May 18 15:26 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 6,225 as a signed binary written in one's complement representation May 18 15:26 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -9,432,948 as a signed binary written in one's complement representation May 18 15:26 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -134,216,639 as a signed binary written in one's complement representation May 18 15:26 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