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

1 100 010 131(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;
  • 1 100 010 131 ÷ 2 = 550 005 065 + 1;
  • 550 005 065 ÷ 2 = 275 002 532 + 1;
  • 275 002 532 ÷ 2 = 137 501 266 + 0;
  • 137 501 266 ÷ 2 = 68 750 633 + 0;
  • 68 750 633 ÷ 2 = 34 375 316 + 1;
  • 34 375 316 ÷ 2 = 17 187 658 + 0;
  • 17 187 658 ÷ 2 = 8 593 829 + 0;
  • 8 593 829 ÷ 2 = 4 296 914 + 1;
  • 4 296 914 ÷ 2 = 2 148 457 + 0;
  • 2 148 457 ÷ 2 = 1 074 228 + 1;
  • 1 074 228 ÷ 2 = 537 114 + 0;
  • 537 114 ÷ 2 = 268 557 + 0;
  • 268 557 ÷ 2 = 134 278 + 1;
  • 134 278 ÷ 2 = 67 139 + 0;
  • 67 139 ÷ 2 = 33 569 + 1;
  • 33 569 ÷ 2 = 16 784 + 1;
  • 16 784 ÷ 2 = 8 392 + 0;
  • 8 392 ÷ 2 = 4 196 + 0;
  • 4 196 ÷ 2 = 2 098 + 0;
  • 2 098 ÷ 2 = 1 049 + 0;
  • 1 049 ÷ 2 = 524 + 1;
  • 524 ÷ 2 = 262 + 0;
  • 262 ÷ 2 = 131 + 0;
  • 131 ÷ 2 = 65 + 1;
  • 65 ÷ 2 = 32 + 1;
  • 32 ÷ 2 = 16 + 0;
  • 16 ÷ 2 = 8 + 0;
  • 8 ÷ 2 = 4 + 0;
  • 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.

1 100 010 131(10) = 100 0001 1001 0000 1101 0010 1001 0011(2)


3. Determine the signed binary number bit length:

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

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


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:

1 100 010 131(10) = 0100 0001 1001 0000 1101 0010 1001 0011


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

1 100 010 131(10) = 0100 0001 1001 0000 1101 0010 1001 0011

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


More operations of this kind:

1 100 010 130 = ? | 1 100 010 132 = ?


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

1,100,010,131 to signed binary one's complement = ? Oct 28 10:32 UTC (GMT)
1,200,415 to signed binary one's complement = ? Oct 28 10:31 UTC (GMT)
-100 to signed binary one's complement = ? Oct 28 10:31 UTC (GMT)
-37 to signed binary one's complement = ? Oct 28 10:31 UTC (GMT)
48,335 to signed binary one's complement = ? Oct 28 10:31 UTC (GMT)
-2,013,265,891 to signed binary one's complement = ? Oct 28 10:31 UTC (GMT)
81,570 to signed binary one's complement = ? Oct 28 10:30 UTC (GMT)
-92 to signed binary one's complement = ? Oct 28 10:29 UTC (GMT)
-79 to signed binary one's complement = ? Oct 28 10:29 UTC (GMT)
769 to signed binary one's complement = ? Oct 28 10:29 UTC (GMT)
184,549,379 to signed binary one's complement = ? Oct 28 10:28 UTC (GMT)
-19 to signed binary one's complement = ? Oct 28 10:27 UTC (GMT)
-435,345,649 to signed binary one's complement = ? Oct 28 10:26 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