Convert -81 985 529 216 485 868 to a Signed Binary (Base 2)

How to convert -81 985 529 216 485 868(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 -81 985 529 216 485 868 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:

|-81 985 529 216 485 868| = 81 985 529 216 485 868

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;
  • 81 985 529 216 485 868 ÷ 2 = 40 992 764 608 242 934 + 0;
  • 40 992 764 608 242 934 ÷ 2 = 20 496 382 304 121 467 + 0;
  • 20 496 382 304 121 467 ÷ 2 = 10 248 191 152 060 733 + 1;
  • 10 248 191 152 060 733 ÷ 2 = 5 124 095 576 030 366 + 1;
  • 5 124 095 576 030 366 ÷ 2 = 2 562 047 788 015 183 + 0;
  • 2 562 047 788 015 183 ÷ 2 = 1 281 023 894 007 591 + 1;
  • 1 281 023 894 007 591 ÷ 2 = 640 511 947 003 795 + 1;
  • 640 511 947 003 795 ÷ 2 = 320 255 973 501 897 + 1;
  • 320 255 973 501 897 ÷ 2 = 160 127 986 750 948 + 1;
  • 160 127 986 750 948 ÷ 2 = 80 063 993 375 474 + 0;
  • 80 063 993 375 474 ÷ 2 = 40 031 996 687 737 + 0;
  • 40 031 996 687 737 ÷ 2 = 20 015 998 343 868 + 1;
  • 20 015 998 343 868 ÷ 2 = 10 007 999 171 934 + 0;
  • 10 007 999 171 934 ÷ 2 = 5 003 999 585 967 + 0;
  • 5 003 999 585 967 ÷ 2 = 2 501 999 792 983 + 1;
  • 2 501 999 792 983 ÷ 2 = 1 250 999 896 491 + 1;
  • 1 250 999 896 491 ÷ 2 = 625 499 948 245 + 1;
  • 625 499 948 245 ÷ 2 = 312 749 974 122 + 1;
  • 312 749 974 122 ÷ 2 = 156 374 987 061 + 0;
  • 156 374 987 061 ÷ 2 = 78 187 493 530 + 1;
  • 78 187 493 530 ÷ 2 = 39 093 746 765 + 0;
  • 39 093 746 765 ÷ 2 = 19 546 873 382 + 1;
  • 19 546 873 382 ÷ 2 = 9 773 436 691 + 0;
  • 9 773 436 691 ÷ 2 = 4 886 718 345 + 1;
  • 4 886 718 345 ÷ 2 = 2 443 359 172 + 1;
  • 2 443 359 172 ÷ 2 = 1 221 679 586 + 0;
  • 1 221 679 586 ÷ 2 = 610 839 793 + 0;
  • 610 839 793 ÷ 2 = 305 419 896 + 1;
  • 305 419 896 ÷ 2 = 152 709 948 + 0;
  • 152 709 948 ÷ 2 = 76 354 974 + 0;
  • 76 354 974 ÷ 2 = 38 177 487 + 0;
  • 38 177 487 ÷ 2 = 19 088 743 + 1;
  • 19 088 743 ÷ 2 = 9 544 371 + 1;
  • 9 544 371 ÷ 2 = 4 772 185 + 1;
  • 4 772 185 ÷ 2 = 2 386 092 + 1;
  • 2 386 092 ÷ 2 = 1 193 046 + 0;
  • 1 193 046 ÷ 2 = 596 523 + 0;
  • 596 523 ÷ 2 = 298 261 + 1;
  • 298 261 ÷ 2 = 149 130 + 1;
  • 149 130 ÷ 2 = 74 565 + 0;
  • 74 565 ÷ 2 = 37 282 + 1;
  • 37 282 ÷ 2 = 18 641 + 0;
  • 18 641 ÷ 2 = 9 320 + 1;
  • 9 320 ÷ 2 = 4 660 + 0;
  • 4 660 ÷ 2 = 2 330 + 0;
  • 2 330 ÷ 2 = 1 165 + 0;
  • 1 165 ÷ 2 = 582 + 1;
  • 582 ÷ 2 = 291 + 0;
  • 291 ÷ 2 = 145 + 1;
  • 145 ÷ 2 = 72 + 1;
  • 72 ÷ 2 = 36 + 0;
  • 36 ÷ 2 = 18 + 0;
  • 18 ÷ 2 = 9 + 0;
  • 9 ÷ 2 = 4 + 1;
  • 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.

81 985 529 216 485 868(10) = 1 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1001 1110 1100(2)


4. Determine the signed binary number bit length:

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

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

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:


81 985 529 216 485 868(10) = 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1001 1110 1100

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


-81 985 529 216 485 868(10) Base 10 integer number converted and written as a signed binary code (in base 2):

-81 985 529 216 485 868(10) = 1000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1001 1110 1100

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

Share

» More ops: Convert -81 985 529 216 485 887, 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 04, 2026 [April]: Signed base 10 integer numbers converted and written as signed binary code. Calculations performed during the month of: April - by our visitors

» Improve your social skills: The Art of Strategic Ambiguity and Concealed Intentions. NotebookLM YouTube Video of 6.59 minutes

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