Integer to Signed Binary: Number -2 149 999 941 Converted and Written as a Signed Binary. Base Ten Decimal System Conversion

Integer number -2 149 999 941(10) written as a signed binary number

1. Start with the positive version of the number:

|-2 149 999 941| = 2 149 999 941

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;
  • 2 149 999 941 ÷ 2 = 1 074 999 970 + 1;
  • 1 074 999 970 ÷ 2 = 537 499 985 + 0;
  • 537 499 985 ÷ 2 = 268 749 992 + 1;
  • 268 749 992 ÷ 2 = 134 374 996 + 0;
  • 134 374 996 ÷ 2 = 67 187 498 + 0;
  • 67 187 498 ÷ 2 = 33 593 749 + 0;
  • 33 593 749 ÷ 2 = 16 796 874 + 1;
  • 16 796 874 ÷ 2 = 8 398 437 + 0;
  • 8 398 437 ÷ 2 = 4 199 218 + 1;
  • 4 199 218 ÷ 2 = 2 099 609 + 0;
  • 2 099 609 ÷ 2 = 1 049 804 + 1;
  • 1 049 804 ÷ 2 = 524 902 + 0;
  • 524 902 ÷ 2 = 262 451 + 0;
  • 262 451 ÷ 2 = 131 225 + 1;
  • 131 225 ÷ 2 = 65 612 + 1;
  • 65 612 ÷ 2 = 32 806 + 0;
  • 32 806 ÷ 2 = 16 403 + 0;
  • 16 403 ÷ 2 = 8 201 + 1;
  • 8 201 ÷ 2 = 4 100 + 1;
  • 4 100 ÷ 2 = 2 050 + 0;
  • 2 050 ÷ 2 = 1 025 + 0;
  • 1 025 ÷ 2 = 512 + 1;
  • 512 ÷ 2 = 256 + 0;
  • 256 ÷ 2 = 128 + 0;
  • 128 ÷ 2 = 64 + 0;
  • 64 ÷ 2 = 32 + 0;
  • 32 ÷ 2 = 16 + 0;
  • 16 ÷ 2 = 8 + 0;
  • 8 ÷ 2 = 4 + 0;
  • 4 ÷ 2 = 2 + 0;
  • 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.

2 149 999 941(10) = 1000 0000 0010 0110 0110 0101 0100 0101(2)


4. Determine the signed binary number bit length:

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

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

The first bit (the leftmost) is reserved for the sign:

0 = positive integer number, 1 = negative integer number


The least number that is:

1) a power of 2

2) and is larger than the actual length, 32,

3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)

=== is: 64.


5. Get the 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:


2 149 999 941(10) = 0000 0000 0000 0000 0000 0000 0000 0000 1000 0000 0010 0110 0110 0101 0100 0101

6. Get the negative integer number representation:

To get the negative integer number representation on 64 bits (8 Bytes),

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


Number -2 149 999 941(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):

-2 149 999 941(10) = 1000 0000 0000 0000 0000 0000 0000 0000 1000 0000 0010 0110 0110 0101 0100 0101

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

» More ops: Integer number -2 149 999 934 converted and written as a signed binary number

» New: All the Calculations Performed by Our Visitors: Integer numbers converted and written as signed binary numbers. Data organized on a Monthly Basis

» Month 01, 2025 [January]: Integer Numbers Converted and Written as Signed Binary. Monthly Calculations performed during the month of: January - by our visitors

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