One's Complement: Integer ↗ Binary: 10 101 110 200 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 10 101 110 200(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;
  • 10 101 110 200 ÷ 2 = 5 050 555 100 + 0;
  • 5 050 555 100 ÷ 2 = 2 525 277 550 + 0;
  • 2 525 277 550 ÷ 2 = 1 262 638 775 + 0;
  • 1 262 638 775 ÷ 2 = 631 319 387 + 1;
  • 631 319 387 ÷ 2 = 315 659 693 + 1;
  • 315 659 693 ÷ 2 = 157 829 846 + 1;
  • 157 829 846 ÷ 2 = 78 914 923 + 0;
  • 78 914 923 ÷ 2 = 39 457 461 + 1;
  • 39 457 461 ÷ 2 = 19 728 730 + 1;
  • 19 728 730 ÷ 2 = 9 864 365 + 0;
  • 9 864 365 ÷ 2 = 4 932 182 + 1;
  • 4 932 182 ÷ 2 = 2 466 091 + 0;
  • 2 466 091 ÷ 2 = 1 233 045 + 1;
  • 1 233 045 ÷ 2 = 616 522 + 1;
  • 616 522 ÷ 2 = 308 261 + 0;
  • 308 261 ÷ 2 = 154 130 + 1;
  • 154 130 ÷ 2 = 77 065 + 0;
  • 77 065 ÷ 2 = 38 532 + 1;
  • 38 532 ÷ 2 = 19 266 + 0;
  • 19 266 ÷ 2 = 9 633 + 0;
  • 9 633 ÷ 2 = 4 816 + 1;
  • 4 816 ÷ 2 = 2 408 + 0;
  • 2 408 ÷ 2 = 1 204 + 0;
  • 1 204 ÷ 2 = 602 + 0;
  • 602 ÷ 2 = 301 + 0;
  • 301 ÷ 2 = 150 + 1;
  • 150 ÷ 2 = 75 + 0;
  • 75 ÷ 2 = 37 + 1;
  • 37 ÷ 2 = 18 + 1;
  • 18 ÷ 2 = 9 + 0;
  • 9 ÷ 2 = 4 + 1;
  • 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.


10 101 110 200(10) = 10 0101 1010 0001 0010 1011 0101 1011 1000(2)


3. Determine the signed binary number bit length:

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

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

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 10 101 110 200(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:

10 101 110 200(10) = 0000 0000 0000 0000 0000 0000 0000 0010 0101 1010 0001 0010 1011 0101 1011 1000

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 10 101 110 199 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 10 101 110 201 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 31,616 as a signed binary written in one's complement representation May 01 09:06 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -66,896 as a signed binary written in one's complement representation May 01 09:04 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -858 as a signed binary written in one's complement representation May 01 09:03 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -11,101,178 as a signed binary written in one's complement representation May 01 09:03 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 830,464 as a signed binary written in one's complement representation May 01 09:03 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 111,100,001,031 as a signed binary written in one's complement representation May 01 09:02 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 111,111,111,111,020 as a signed binary written in one's complement representation May 01 09:02 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 2,690 as a signed binary written in one's complement representation May 01 09:01 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number -7,572 as a signed binary written in one's complement representation May 01 09:01 UTC (GMT)
Convert and write the decimal system (base 10) signed integer number 11,000,997 as a signed binary written in one's complement representation May 01 09:01 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