Convert -99 999 999 999 616 to a Signed Binary (Base 2)

How to convert -99 999 999 999 616(10), a signed base 10 integer number? How to write it as a signed binary code in base 2

What are the required steps to convert base 10 integer
number -99 999 999 999 616 to signed binary code (in base 2)?

  • A signed integer, written in base ten, or a decimal system number, is a number written using the digits 0 through 9 and the sign, which can be positive (+) or negative (-). If positive, the sign is usually not written. A number written in base two, or binary, is a number written using only the digits 0 and 1.

1. Start with the positive version of the number:

|-99 999 999 999 616| = 99 999 999 999 616

2. Divide the number repeatedly by 2:

Keep track of each remainder.

Stop when you get a quotient that is equal to zero.


  • division = quotient + remainder;
  • 99 999 999 999 616 ÷ 2 = 49 999 999 999 808 + 0;
  • 49 999 999 999 808 ÷ 2 = 24 999 999 999 904 + 0;
  • 24 999 999 999 904 ÷ 2 = 12 499 999 999 952 + 0;
  • 12 499 999 999 952 ÷ 2 = 6 249 999 999 976 + 0;
  • 6 249 999 999 976 ÷ 2 = 3 124 999 999 988 + 0;
  • 3 124 999 999 988 ÷ 2 = 1 562 499 999 994 + 0;
  • 1 562 499 999 994 ÷ 2 = 781 249 999 997 + 0;
  • 781 249 999 997 ÷ 2 = 390 624 999 998 + 1;
  • 390 624 999 998 ÷ 2 = 195 312 499 999 + 0;
  • 195 312 499 999 ÷ 2 = 97 656 249 999 + 1;
  • 97 656 249 999 ÷ 2 = 48 828 124 999 + 1;
  • 48 828 124 999 ÷ 2 = 24 414 062 499 + 1;
  • 24 414 062 499 ÷ 2 = 12 207 031 249 + 1;
  • 12 207 031 249 ÷ 2 = 6 103 515 624 + 1;
  • 6 103 515 624 ÷ 2 = 3 051 757 812 + 0;
  • 3 051 757 812 ÷ 2 = 1 525 878 906 + 0;
  • 1 525 878 906 ÷ 2 = 762 939 453 + 0;
  • 762 939 453 ÷ 2 = 381 469 726 + 1;
  • 381 469 726 ÷ 2 = 190 734 863 + 0;
  • 190 734 863 ÷ 2 = 95 367 431 + 1;
  • 95 367 431 ÷ 2 = 47 683 715 + 1;
  • 47 683 715 ÷ 2 = 23 841 857 + 1;
  • 23 841 857 ÷ 2 = 11 920 928 + 1;
  • 11 920 928 ÷ 2 = 5 960 464 + 0;
  • 5 960 464 ÷ 2 = 2 980 232 + 0;
  • 2 980 232 ÷ 2 = 1 490 116 + 0;
  • 1 490 116 ÷ 2 = 745 058 + 0;
  • 745 058 ÷ 2 = 372 529 + 0;
  • 372 529 ÷ 2 = 186 264 + 1;
  • 186 264 ÷ 2 = 93 132 + 0;
  • 93 132 ÷ 2 = 46 566 + 0;
  • 46 566 ÷ 2 = 23 283 + 0;
  • 23 283 ÷ 2 = 11 641 + 1;
  • 11 641 ÷ 2 = 5 820 + 1;
  • 5 820 ÷ 2 = 2 910 + 0;
  • 2 910 ÷ 2 = 1 455 + 0;
  • 1 455 ÷ 2 = 727 + 1;
  • 727 ÷ 2 = 363 + 1;
  • 363 ÷ 2 = 181 + 1;
  • 181 ÷ 2 = 90 + 1;
  • 90 ÷ 2 = 45 + 0;
  • 45 ÷ 2 = 22 + 1;
  • 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.

99 999 999 999 616(10) = 101 1010 1111 0011 0001 0000 0111 1010 0011 1110 1000 0000(2)


4. Determine the signed binary number bit length:

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

  • 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, 47,

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:


99 999 999 999 616(10) = 0000 0000 0000 0000 0101 1010 1111 0011 0001 0000 0111 1010 0011 1110 1000 0000

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


-99 999 999 999 616(10) Base 10 integer number converted and written as a signed binary code (in base 2):

-99 999 999 999 616(10) = 1000 0000 0000 0000 0101 1010 1111 0011 0001 0000 0111 1010 0011 1110 1000 0000

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

» More ops: Convert -99 999 999 999 567, a signed base 10 integer number, write it as a signed binary code (in base 2) equivalent

» Calculations Performed by Our Visitors: Signed base 10 integer numbers converted and written as signed binary code (base 2) equivalents. Data organized on a Monthly Basis

» Month 10, 2026 [October]: Signed base 10 integer numbers converted and written as signed binary code. Calculations performed during the month of: October - by our visitors

How to convert signed base 10 integers in decimal 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