Convert 110 100 099 to a signed binary in one's complement representation, from a base 10 decimal system signed integer number

110 100 099(10) to a signed binary 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;
  • 110 100 099 ÷ 2 = 55 050 049 + 1;
  • 55 050 049 ÷ 2 = 27 525 024 + 1;
  • 27 525 024 ÷ 2 = 13 762 512 + 0;
  • 13 762 512 ÷ 2 = 6 881 256 + 0;
  • 6 881 256 ÷ 2 = 3 440 628 + 0;
  • 3 440 628 ÷ 2 = 1 720 314 + 0;
  • 1 720 314 ÷ 2 = 860 157 + 0;
  • 860 157 ÷ 2 = 430 078 + 1;
  • 430 078 ÷ 2 = 215 039 + 0;
  • 215 039 ÷ 2 = 107 519 + 1;
  • 107 519 ÷ 2 = 53 759 + 1;
  • 53 759 ÷ 2 = 26 879 + 1;
  • 26 879 ÷ 2 = 13 439 + 1;
  • 13 439 ÷ 2 = 6 719 + 1;
  • 6 719 ÷ 2 = 3 359 + 1;
  • 3 359 ÷ 2 = 1 679 + 1;
  • 1 679 ÷ 2 = 839 + 1;
  • 839 ÷ 2 = 419 + 1;
  • 419 ÷ 2 = 209 + 1;
  • 209 ÷ 2 = 104 + 1;
  • 104 ÷ 2 = 52 + 0;
  • 52 ÷ 2 = 26 + 0;
  • 26 ÷ 2 = 13 + 0;
  • 13 ÷ 2 = 6 + 1;
  • 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.

110 100 099(10) = 110 1000 1111 1111 1110 1000 0011(2)


3. Determine the signed binary number bit length:

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

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; ...

First bit (the leftmost) indicates the sign,
1 = negative, 0 = positive.

The least number that is:


a power of 2


and is larger than the actual length, 27,


so that the first bit (leftmost) could be zero


(we deal with a positive number at this moment)


is: 32.


4. 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:

110 100 099(10) = 0000 0110 1000 1111 1111 1110 1000 0011


Number 110 100 099, a signed integer, converted from decimal system (base 10) to a signed binary one's complement representation:

110 100 099(10) = 0000 0110 1000 1111 1111 1110 1000 0011

Spaces used to group digits: for binary, by 4; for decimal, by 3.


More operations of this kind:

110 100 098 = ? | 110 100 100 = ?


Convert signed integer numbers from the decimal system (base ten) to signed binary one's complement representation

How to convert a base 10 signed integer number to signed binary in one's complement representation:

1) Divide the positive version of number repeatedly by 2, keeping track of each remainder, till getting a quotient that is 0.

2) Construct the base 2 representation by taking the previously calculated remainders starting from the last remainder up to the first one, in that order.

3) Construct the positive binary computer representation so that the first bit is 0.

4) Only if the initial number is negative, switch all the bits from 0 to 1 and from 1 to 0 (reversing the digits).

Latest signed integer numbers converted from decimal system to signed binary in one's complement representation

110,100,099 to signed binary one's complement = ? May 06 17:59 UTC (GMT)
10,001,032 to signed binary one's complement = ? May 06 17:59 UTC (GMT)
1,789 to signed binary one's complement = ? May 06 17:59 UTC (GMT)
521 to signed binary one's complement = ? May 06 17:59 UTC (GMT)
62,956 to signed binary one's complement = ? May 06 17:58 UTC (GMT)
1,099,985 to signed binary one's complement = ? May 06 17:57 UTC (GMT)
543,216,784 to signed binary one's complement = ? May 06 17:57 UTC (GMT)
11,111,000,003 to signed binary one's complement = ? May 06 17:56 UTC (GMT)
110 to signed binary one's complement = ? May 06 17:56 UTC (GMT)
803 to signed binary one's complement = ? May 06 17:56 UTC (GMT)
-7,059 to signed binary one's complement = ? May 06 17:56 UTC (GMT)
5,760 to signed binary one's complement = ? May 06 17:55 UTC (GMT)
-16 to signed binary one's complement = ? May 06 17:54 UTC (GMT)
All decimal integer numbers converted to signed binary 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