Convert -1 073 741 699 to signed binary, from a base 10 decimal system signed integer number

-1 073 741 699(10) to a signed binary = ?

1. Start with the positive version of the number:

|-1 073 741 699| = 1 073 741 699

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 073 741 699 ÷ 2 = 536 870 849 + 1;
  • 536 870 849 ÷ 2 = 268 435 424 + 1;
  • 268 435 424 ÷ 2 = 134 217 712 + 0;
  • 134 217 712 ÷ 2 = 67 108 856 + 0;
  • 67 108 856 ÷ 2 = 33 554 428 + 0;
  • 33 554 428 ÷ 2 = 16 777 214 + 0;
  • 16 777 214 ÷ 2 = 8 388 607 + 0;
  • 8 388 607 ÷ 2 = 4 194 303 + 1;
  • 4 194 303 ÷ 2 = 2 097 151 + 1;
  • 2 097 151 ÷ 2 = 1 048 575 + 1;
  • 1 048 575 ÷ 2 = 524 287 + 1;
  • 524 287 ÷ 2 = 262 143 + 1;
  • 262 143 ÷ 2 = 131 071 + 1;
  • 131 071 ÷ 2 = 65 535 + 1;
  • 65 535 ÷ 2 = 32 767 + 1;
  • 32 767 ÷ 2 = 16 383 + 1;
  • 16 383 ÷ 2 = 8 191 + 1;
  • 8 191 ÷ 2 = 4 095 + 1;
  • 4 095 ÷ 2 = 2 047 + 1;
  • 2 047 ÷ 2 = 1 023 + 1;
  • 1 023 ÷ 2 = 511 + 1;
  • 511 ÷ 2 = 255 + 1;
  • 255 ÷ 2 = 127 + 1;
  • 127 ÷ 2 = 63 + 1;
  • 63 ÷ 2 = 31 + 1;
  • 31 ÷ 2 = 15 + 1;
  • 15 ÷ 2 = 7 + 1;
  • 7 ÷ 2 = 3 + 1;
  • 3 ÷ 2 = 1 + 1;
  • 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 073 741 699(10) = 11 1111 1111 1111 1111 1111 1000 0011(2)


4. Determine the signed binary number bit length:

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

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) is reserved for the sign:
0 = positive integer number, 1 = negative integer number

The least number that is:


a power of 2


and is larger than the actual length, 30,


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 073 741 699(10) = 0011 1111 1111 1111 1111 1111 1000 0011


6. Get the negative integer number representation:

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


change the first bit (the leftmost), from 0 to 1:


-1 073 741 699(10) =


1011 1111 1111 1111 1111 1111 1000 0011


Number -1 073 741 699, a signed integer, converted from decimal system (base 10) to signed binary:

-1 073 741 699(10) = 1011 1111 1111 1111 1111 1111 1000 0011

First bit (the leftmost) is reserved for the sign:
0 = positive integer number, 1 = negative integer number

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


More operations of this kind:

-1 073 741 700 = ? | Signed integer -1 073 741 698 = ?


Convert signed integer numbers from the decimal system (base ten) to signed binary

How to convert a base 10 signed integer number to signed binary:

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, change the first bit (the leftmost), from 0 to 1. The leftmost bit is reserved for the sign, 1 = negative, 0 = positive.

Latest signed integer numbers in decimal (base ten) converted to signed binary

-1,073,741,699 to signed binary = ? May 12 07:45 UTC (GMT)
-1,155,685 to signed binary = ? May 12 07:45 UTC (GMT)
-15,724,560 to signed binary = ? May 12 07:45 UTC (GMT)
21,301,090 to signed binary = ? May 12 07:45 UTC (GMT)
-1,816,865,638 to signed binary = ? May 12 07:45 UTC (GMT)
26,504 to signed binary = ? May 12 07:44 UTC (GMT)
-163,820,007 to signed binary = ? May 12 07:44 UTC (GMT)
-2,703 to signed binary = ? May 12 07:44 UTC (GMT)
1,431,655,861 to signed binary = ? May 12 07:44 UTC (GMT)
4,294,901,740 to signed binary = ? May 12 07:44 UTC (GMT)
-8,897,758 to signed binary = ? May 12 07:44 UTC (GMT)
1,010,101,101,010,010,972 to signed binary = ? May 12 07:44 UTC (GMT)
19,525,174 to signed binary = ? May 12 07:44 UTC (GMT)
All decimal positive integers converted to signed binary

How to convert signed integers from decimal system to binary code system

Follow the steps below to convert a signed base ten integer number to signed binary:

  • 1. In a signed binary, first bit (the leftmost) is reserved for sign: 0 = positive integer number, 1 = positive integer number. If the number to be converted is negative, start with its positive version.
  • 2. Divide repeatedly by 2 the positive integer number keeping track of each remainder. STOP when we get a quotient that is 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 have a length of 4, 8, 16, 32, 64, ... bits (power of 2) - if needed, fill in extra '0' bits in front of the base 2 number (to the left), up to the right length; this way the first bit (the leftmost one) is always '0', as for a positive representation.
  • 5. To get the negative reprezentation of the number, simply switch the first bit (the leftmost one), from '0' to '1'.

Example: convert the negative number -63 from decimal system (base ten) to signed binary code system:

  • 1. Start with the positive version of the number: |-63| = 63;
  • 2. Divide repeatedly 63 by 2, keeping track of each remainder, until we get a quotient that is equal to zero:
    • division = quotient + remainder
    • 63 ÷ 2 = 31 + 1
    • 31 ÷ 2 = 15 + 1
    • 15 ÷ 2 = 7 + 1
    • 7 ÷ 2 = 3 + 1
    • 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:
    63(10) = 11 1111(2)
  • 4. The actual length of base 2 representation number is 6, so the positive binary computer representation length of the signed binary will take in this case 8 bits (the least power of 2 higher than 6) - add extra '0's in front (to the left), up to the required length; this way the first bit (the leftmost one) is to be '0', as for a positive number:
    63(10) = 0011 1111(2)
  • 5. To get the negative integer number representation simply change the first bit (the leftmost), from '0' to '1':
    -63(10) = 1011 1111
  • Number -63(10), signed integer, converted from decimal system (base 10) to signed binary = 1011 1111