One's Complement: Integer Number 10 111 110 151 Converted and Written as a Signed Binary in One's Complement Representation

Integer number 10 111 110 151(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 111 110 151 ÷ 2 = 5 055 555 075 + 1;
  • 5 055 555 075 ÷ 2 = 2 527 777 537 + 1;
  • 2 527 777 537 ÷ 2 = 1 263 888 768 + 1;
  • 1 263 888 768 ÷ 2 = 631 944 384 + 0;
  • 631 944 384 ÷ 2 = 315 972 192 + 0;
  • 315 972 192 ÷ 2 = 157 986 096 + 0;
  • 157 986 096 ÷ 2 = 78 993 048 + 0;
  • 78 993 048 ÷ 2 = 39 496 524 + 0;
  • 39 496 524 ÷ 2 = 19 748 262 + 0;
  • 19 748 262 ÷ 2 = 9 874 131 + 0;
  • 9 874 131 ÷ 2 = 4 937 065 + 1;
  • 4 937 065 ÷ 2 = 2 468 532 + 1;
  • 2 468 532 ÷ 2 = 1 234 266 + 0;
  • 1 234 266 ÷ 2 = 617 133 + 0;
  • 617 133 ÷ 2 = 308 566 + 1;
  • 308 566 ÷ 2 = 154 283 + 0;
  • 154 283 ÷ 2 = 77 141 + 1;
  • 77 141 ÷ 2 = 38 570 + 1;
  • 38 570 ÷ 2 = 19 285 + 0;
  • 19 285 ÷ 2 = 9 642 + 1;
  • 9 642 ÷ 2 = 4 821 + 0;
  • 4 821 ÷ 2 = 2 410 + 1;
  • 2 410 ÷ 2 = 1 205 + 0;
  • 1 205 ÷ 2 = 602 + 1;
  • 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 111 110 151(10) = 10 0101 1010 1010 1011 0100 1100 0000 0111(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 111 110 151(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 111 110 151(10) = 0000 0000 0000 0000 0000 0000 0000 0010 0101 1010 1010 1011 0100 1100 0000 0111

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 111 110 150 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 111 110 152 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