Signed: Integer ↗ Binary: 11 111 099 994 Convert the Integer Number to a Signed Binary. Converting and Writing the Base Ten Decimal System Signed Integer as Binary Code (Written in Base Two)

Signed integer number 11 111 099 994(10)
converted and written as a signed binary (base 2) = ?

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;
  • 11 111 099 994 ÷ 2 = 5 555 549 997 + 0;
  • 5 555 549 997 ÷ 2 = 2 777 774 998 + 1;
  • 2 777 774 998 ÷ 2 = 1 388 887 499 + 0;
  • 1 388 887 499 ÷ 2 = 694 443 749 + 1;
  • 694 443 749 ÷ 2 = 347 221 874 + 1;
  • 347 221 874 ÷ 2 = 173 610 937 + 0;
  • 173 610 937 ÷ 2 = 86 805 468 + 1;
  • 86 805 468 ÷ 2 = 43 402 734 + 0;
  • 43 402 734 ÷ 2 = 21 701 367 + 0;
  • 21 701 367 ÷ 2 = 10 850 683 + 1;
  • 10 850 683 ÷ 2 = 5 425 341 + 1;
  • 5 425 341 ÷ 2 = 2 712 670 + 1;
  • 2 712 670 ÷ 2 = 1 356 335 + 0;
  • 1 356 335 ÷ 2 = 678 167 + 1;
  • 678 167 ÷ 2 = 339 083 + 1;
  • 339 083 ÷ 2 = 169 541 + 1;
  • 169 541 ÷ 2 = 84 770 + 1;
  • 84 770 ÷ 2 = 42 385 + 0;
  • 42 385 ÷ 2 = 21 192 + 1;
  • 21 192 ÷ 2 = 10 596 + 0;
  • 10 596 ÷ 2 = 5 298 + 0;
  • 5 298 ÷ 2 = 2 649 + 0;
  • 2 649 ÷ 2 = 1 324 + 1;
  • 1 324 ÷ 2 = 662 + 0;
  • 662 ÷ 2 = 331 + 0;
  • 331 ÷ 2 = 165 + 1;
  • 165 ÷ 2 = 82 + 1;
  • 82 ÷ 2 = 41 + 0;
  • 41 ÷ 2 = 20 + 1;
  • 20 ÷ 2 = 10 + 0;
  • 10 ÷ 2 = 5 + 0;
  • 5 ÷ 2 = 2 + 1;
  • 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.


11 111 099 994(10) = 10 1001 0110 0100 0101 1110 1110 0101 1010(2)


3. Determine the signed binary number bit length:

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

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

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

=== is: 64.


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


Number 11 111 099 994(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):

11 111 099 994(10) = 0000 0000 0000 0000 0000 0000 0000 0010 1001 0110 0100 0101 1110 1110 0101 1010

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

More operations on signed integer numbers:

» Signed integer number 11 111 099 993 converted from decimal system (from base 10) and written as a signed binary (in base 2) = ?

» Signed integer number 11 111 099 995 converted from decimal system (from base 10) and written as a signed binary (in base 2) = ?

The latest signed integer numbers (that are written in decimal system, in base ten) converted and written as signed binary numbers

Convert the base ten decimal system integer number -1,598,898,152, write it as a signed binary written in base two Apr 18 07:59 UTC (GMT)
Convert the base ten decimal system integer number -1,977,290,578, write it as a signed binary written in base two Apr 18 07:58 UTC (GMT)
Convert the base ten decimal system integer number 14,603, write it as a signed binary written in base two Apr 18 07:58 UTC (GMT)
Convert the base ten decimal system integer number -1,232,752,248, write it as a signed binary written in base two Apr 18 07:58 UTC (GMT)
Convert the base ten decimal system integer number 10,332, write it as a signed binary written in base two Apr 18 07:58 UTC (GMT)
Convert the base ten decimal system integer number 1,735, write it as a signed binary written in base two Apr 18 07:57 UTC (GMT)
Convert the base ten decimal system integer number 2,650,512,135, write it as a signed binary written in base two Apr 18 07:57 UTC (GMT)
Convert the base ten decimal system integer number 2,131, write it as a signed binary written in base two Apr 18 07:57 UTC (GMT)
Convert the base ten decimal system integer number -127, write it as a signed binary written in base two Apr 18 07:57 UTC (GMT)
Convert the base ten decimal system integer number 7,895, write it as a signed binary written in base two Apr 18 07:56 UTC (GMT)
All the decimal system integer numbers (written in base ten) converted and written as signed binary numbers

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