One's Complement: Integer ↗ Binary: 6 552 442 618 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 6 552 442 618(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;
  • 6 552 442 618 ÷ 2 = 3 276 221 309 + 0;
  • 3 276 221 309 ÷ 2 = 1 638 110 654 + 1;
  • 1 638 110 654 ÷ 2 = 819 055 327 + 0;
  • 819 055 327 ÷ 2 = 409 527 663 + 1;
  • 409 527 663 ÷ 2 = 204 763 831 + 1;
  • 204 763 831 ÷ 2 = 102 381 915 + 1;
  • 102 381 915 ÷ 2 = 51 190 957 + 1;
  • 51 190 957 ÷ 2 = 25 595 478 + 1;
  • 25 595 478 ÷ 2 = 12 797 739 + 0;
  • 12 797 739 ÷ 2 = 6 398 869 + 1;
  • 6 398 869 ÷ 2 = 3 199 434 + 1;
  • 3 199 434 ÷ 2 = 1 599 717 + 0;
  • 1 599 717 ÷ 2 = 799 858 + 1;
  • 799 858 ÷ 2 = 399 929 + 0;
  • 399 929 ÷ 2 = 199 964 + 1;
  • 199 964 ÷ 2 = 99 982 + 0;
  • 99 982 ÷ 2 = 49 991 + 0;
  • 49 991 ÷ 2 = 24 995 + 1;
  • 24 995 ÷ 2 = 12 497 + 1;
  • 12 497 ÷ 2 = 6 248 + 1;
  • 6 248 ÷ 2 = 3 124 + 0;
  • 3 124 ÷ 2 = 1 562 + 0;
  • 1 562 ÷ 2 = 781 + 0;
  • 781 ÷ 2 = 390 + 1;
  • 390 ÷ 2 = 195 + 0;
  • 195 ÷ 2 = 97 + 1;
  • 97 ÷ 2 = 48 + 1;
  • 48 ÷ 2 = 24 + 0;
  • 24 ÷ 2 = 12 + 0;
  • 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.


6 552 442 618(10) = 1 1000 0110 1000 1110 0101 0110 1111 1010(2)


3. Determine the signed binary number bit length:

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

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

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 6 552 442 618(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:

6 552 442 618(10) = 0000 0000 0000 0000 0000 0000 0000 0001 1000 0110 1000 1110 0101 0110 1111 1010

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 6 552 442 617 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 6 552 442 619 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 -620,458 as a signed binary written in one's complement representation May 17 05:12 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 63,891 as a signed binary written in one's complement representation May 17 05:12 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -2,146,959,246 as a signed binary written in one's complement representation May 17 05:12 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 96,670,476 as a signed binary written in one's complement representation May 17 05:11 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -11,111,237 as a signed binary written in one's complement representation May 17 05:11 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 1,111,111,111,111,111 as a signed binary written in one's complement representation May 17 05:09 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 11,011,010,189 as a signed binary written in one's complement representation May 17 05:09 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 1,101,109,999 as a signed binary written in one's complement representation May 17 05:05 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 11,001,000 as a signed binary written in one's complement representation May 17 05:05 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 17 05:05 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