Convert 1 111 010 000 001 104 to a signed binary in one's complement representation, from a base 10 decimal system signed integer number

1 111 010 000 001 104(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 111 010 000 001 104 ÷ 2 = 555 505 000 000 552 + 0;
  • 555 505 000 000 552 ÷ 2 = 277 752 500 000 276 + 0;
  • 277 752 500 000 276 ÷ 2 = 138 876 250 000 138 + 0;
  • 138 876 250 000 138 ÷ 2 = 69 438 125 000 069 + 0;
  • 69 438 125 000 069 ÷ 2 = 34 719 062 500 034 + 1;
  • 34 719 062 500 034 ÷ 2 = 17 359 531 250 017 + 0;
  • 17 359 531 250 017 ÷ 2 = 8 679 765 625 008 + 1;
  • 8 679 765 625 008 ÷ 2 = 4 339 882 812 504 + 0;
  • 4 339 882 812 504 ÷ 2 = 2 169 941 406 252 + 0;
  • 2 169 941 406 252 ÷ 2 = 1 084 970 703 126 + 0;
  • 1 084 970 703 126 ÷ 2 = 542 485 351 563 + 0;
  • 542 485 351 563 ÷ 2 = 271 242 675 781 + 1;
  • 271 242 675 781 ÷ 2 = 135 621 337 890 + 1;
  • 135 621 337 890 ÷ 2 = 67 810 668 945 + 0;
  • 67 810 668 945 ÷ 2 = 33 905 334 472 + 1;
  • 33 905 334 472 ÷ 2 = 16 952 667 236 + 0;
  • 16 952 667 236 ÷ 2 = 8 476 333 618 + 0;
  • 8 476 333 618 ÷ 2 = 4 238 166 809 + 0;
  • 4 238 166 809 ÷ 2 = 2 119 083 404 + 1;
  • 2 119 083 404 ÷ 2 = 1 059 541 702 + 0;
  • 1 059 541 702 ÷ 2 = 529 770 851 + 0;
  • 529 770 851 ÷ 2 = 264 885 425 + 1;
  • 264 885 425 ÷ 2 = 132 442 712 + 1;
  • 132 442 712 ÷ 2 = 66 221 356 + 0;
  • 66 221 356 ÷ 2 = 33 110 678 + 0;
  • 33 110 678 ÷ 2 = 16 555 339 + 0;
  • 16 555 339 ÷ 2 = 8 277 669 + 1;
  • 8 277 669 ÷ 2 = 4 138 834 + 1;
  • 4 138 834 ÷ 2 = 2 069 417 + 0;
  • 2 069 417 ÷ 2 = 1 034 708 + 1;
  • 1 034 708 ÷ 2 = 517 354 + 0;
  • 517 354 ÷ 2 = 258 677 + 0;
  • 258 677 ÷ 2 = 129 338 + 1;
  • 129 338 ÷ 2 = 64 669 + 0;
  • 64 669 ÷ 2 = 32 334 + 1;
  • 32 334 ÷ 2 = 16 167 + 0;
  • 16 167 ÷ 2 = 8 083 + 1;
  • 8 083 ÷ 2 = 4 041 + 1;
  • 4 041 ÷ 2 = 2 020 + 1;
  • 2 020 ÷ 2 = 1 010 + 0;
  • 1 010 ÷ 2 = 505 + 0;
  • 505 ÷ 2 = 252 + 1;
  • 252 ÷ 2 = 126 + 0;
  • 126 ÷ 2 = 63 + 0;
  • 63 ÷ 2 = 31 + 1;
  • 31 ÷ 2 = 15 + 1;
  • 15 ÷ 2 = 7 + 1;
  • 7 ÷ 2 = 3 + 1;
  • 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.

1 111 010 000 001 104(10) = 11 1111 0010 0111 0101 0010 1100 0110 0100 0101 1000 0101 0000(2)


3. Determine the signed binary number bit length:

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

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


so that the first bit (leftmost) could be zero


(we deal with a positive number at this moment)


is: 64.


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

1 111 010 000 001 104(10) = 0000 0000 0000 0011 1111 0010 0111 0101 0010 1100 0110 0100 0101 1000 0101 0000


Number 1 111 010 000 001 104, a signed integer, converted from decimal system (base 10) to a signed binary one's complement representation:

1 111 010 000 001 104(10) = 0000 0000 0000 0011 1111 0010 0111 0101 0010 1100 0110 0100 0101 1000 0101 0000

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


More operations of this kind:

1 111 010 000 001 103 = ? | 1 111 010 000 001 105 = ?


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,111,010,000,001,104 to signed binary one's complement = ? Feb 24 17:36 UTC (GMT)
58,256 to signed binary one's complement = ? Feb 24 17:35 UTC (GMT)
30,360 to signed binary one's complement = ? Feb 24 17:35 UTC (GMT)
5,738 to signed binary one's complement = ? Feb 24 17:35 UTC (GMT)
99,987 to signed binary one's complement = ? Feb 24 17:35 UTC (GMT)
100,111,004 to signed binary one's complement = ? Feb 24 17:35 UTC (GMT)
-9,854 to signed binary one's complement = ? Feb 24 17:35 UTC (GMT)
5,736 to signed binary one's complement = ? Feb 24 17:34 UTC (GMT)
571,263 to signed binary one's complement = ? Feb 24 17:34 UTC (GMT)
-32,764 to signed binary one's complement = ? Feb 24 17:34 UTC (GMT)
5,957 to signed binary one's complement = ? Feb 24 17:34 UTC (GMT)
110,000,997 to signed binary one's complement = ? Feb 24 17:33 UTC (GMT)
4,699 to signed binary one's complement = ? Feb 24 17:33 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