One's Complement: Integer Number 10 000 160 Converted and Written as a Signed Binary in One's Complement Representation

Integer number 10 000 160(10) written as a signed binary in one's complement representation

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 000 160 ÷ 2 = 5 000 080 + 0;
  • 5 000 080 ÷ 2 = 2 500 040 + 0;
  • 2 500 040 ÷ 2 = 1 250 020 + 0;
  • 1 250 020 ÷ 2 = 625 010 + 0;
  • 625 010 ÷ 2 = 312 505 + 0;
  • 312 505 ÷ 2 = 156 252 + 1;
  • 156 252 ÷ 2 = 78 126 + 0;
  • 78 126 ÷ 2 = 39 063 + 0;
  • 39 063 ÷ 2 = 19 531 + 1;
  • 19 531 ÷ 2 = 9 765 + 1;
  • 9 765 ÷ 2 = 4 882 + 1;
  • 4 882 ÷ 2 = 2 441 + 0;
  • 2 441 ÷ 2 = 1 220 + 1;
  • 1 220 ÷ 2 = 610 + 0;
  • 610 ÷ 2 = 305 + 0;
  • 305 ÷ 2 = 152 + 1;
  • 152 ÷ 2 = 76 + 0;
  • 76 ÷ 2 = 38 + 0;
  • 38 ÷ 2 = 19 + 0;
  • 19 ÷ 2 = 9 + 1;
  • 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 000 160(10) = 1001 1000 1001 0111 0010 0000(2)


3. Determine the signed binary number bit length:

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

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

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

=== is: 32.


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

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


Number 10 000 160(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 000 160(10) = 0000 0000 1001 1000 1001 0111 0010 0000

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 000 159 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 000 161 converted from decimal system (from base 10) and written as a signed binary in one's complement representation (written in base 2) = ?

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