Convert -1 480 665 349 to a signed binary in one's complement representation, from a base 10 decimal system signed integer number

-1 480 665 349(10) to a signed binary one's complement representation = ?

1. Start with the positive version of the number:

|-1 480 665 349| = 1 480 665 349

2. 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 480 665 349 ÷ 2 = 740 332 674 + 1;
  • 740 332 674 ÷ 2 = 370 166 337 + 0;
  • 370 166 337 ÷ 2 = 185 083 168 + 1;
  • 185 083 168 ÷ 2 = 92 541 584 + 0;
  • 92 541 584 ÷ 2 = 46 270 792 + 0;
  • 46 270 792 ÷ 2 = 23 135 396 + 0;
  • 23 135 396 ÷ 2 = 11 567 698 + 0;
  • 11 567 698 ÷ 2 = 5 783 849 + 0;
  • 5 783 849 ÷ 2 = 2 891 924 + 1;
  • 2 891 924 ÷ 2 = 1 445 962 + 0;
  • 1 445 962 ÷ 2 = 722 981 + 0;
  • 722 981 ÷ 2 = 361 490 + 1;
  • 361 490 ÷ 2 = 180 745 + 0;
  • 180 745 ÷ 2 = 90 372 + 1;
  • 90 372 ÷ 2 = 45 186 + 0;
  • 45 186 ÷ 2 = 22 593 + 0;
  • 22 593 ÷ 2 = 11 296 + 1;
  • 11 296 ÷ 2 = 5 648 + 0;
  • 5 648 ÷ 2 = 2 824 + 0;
  • 2 824 ÷ 2 = 1 412 + 0;
  • 1 412 ÷ 2 = 706 + 0;
  • 706 ÷ 2 = 353 + 0;
  • 353 ÷ 2 = 176 + 1;
  • 176 ÷ 2 = 88 + 0;
  • 88 ÷ 2 = 44 + 0;
  • 44 ÷ 2 = 22 + 0;
  • 22 ÷ 2 = 11 + 0;
  • 11 ÷ 2 = 5 + 1;
  • 5 ÷ 2 = 2 + 1;
  • 2 ÷ 2 = 1 + 0;
  • 1 ÷ 2 = 0 + 1;

3. Construct the base 2 representation of the positive number:

Take all the remainders starting from the bottom of the list constructed above.

1 480 665 349(10) = 101 1000 0100 0001 0010 1001 0000 0101(2)


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


5. 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 480 665 349(10) = 0101 1000 0100 0001 0010 1001 0000 0101


6. Get the negative integer number representation:

To get the negative integer number representation on 32 bits (4 Bytes),


signed binary one's complement,


replace all the bits on 0 with 1s


and all the bits set on 1 with 0s


(reverse the digits, flip the digits)


!(0101 1000 0100 0001 0010 1001 0000 0101) =


1010 0111 1011 1110 1101 0110 1111 1010


Number -1 480 665 349, a signed integer, converted from decimal system (base 10) to a signed binary one's complement representation:

-1 480 665 349(10) = 1010 0111 1011 1110 1101 0110 1111 1010

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


More operations of this kind:

-1 480 665 350 = ? | -1 480 665 348 = ?


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,480,665,349 to signed binary one's complement = ? Jul 24 11:44 UTC (GMT)
9,223,372,036,854,775,776 to signed binary one's complement = ? Jul 24 11:44 UTC (GMT)
616 to signed binary one's complement = ? Jul 24 11:44 UTC (GMT)
20,250 to signed binary one's complement = ? Jul 24 11:44 UTC (GMT)
-1,869,596,489 to signed binary one's complement = ? Jul 24 11:44 UTC (GMT)
-11,920 to signed binary one's complement = ? Jul 24 11:43 UTC (GMT)
101,101,019 to signed binary one's complement = ? Jul 24 11:43 UTC (GMT)
385,120 to signed binary one's complement = ? Jul 24 11:43 UTC (GMT)
-11,920 to signed binary one's complement = ? Jul 24 11:42 UTC (GMT)
2,952 to signed binary one's complement = ? Jul 24 11:42 UTC (GMT)
-1,699 to signed binary one's complement = ? Jul 24 11:42 UTC (GMT)
10,111,026 to signed binary one's complement = ? Jul 24 11:42 UTC (GMT)
1,000,317 to signed binary one's complement = ? Jul 24 11:42 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