Convert -15 832 967 439 219 to a Signed Binary (Base 2)

How to convert -15 832 967 439 219(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 -15 832 967 439 219 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:

|-15 832 967 439 219| = 15 832 967 439 219

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;
  • 15 832 967 439 219 ÷ 2 = 7 916 483 719 609 + 1;
  • 7 916 483 719 609 ÷ 2 = 3 958 241 859 804 + 1;
  • 3 958 241 859 804 ÷ 2 = 1 979 120 929 902 + 0;
  • 1 979 120 929 902 ÷ 2 = 989 560 464 951 + 0;
  • 989 560 464 951 ÷ 2 = 494 780 232 475 + 1;
  • 494 780 232 475 ÷ 2 = 247 390 116 237 + 1;
  • 247 390 116 237 ÷ 2 = 123 695 058 118 + 1;
  • 123 695 058 118 ÷ 2 = 61 847 529 059 + 0;
  • 61 847 529 059 ÷ 2 = 30 923 764 529 + 1;
  • 30 923 764 529 ÷ 2 = 15 461 882 264 + 1;
  • 15 461 882 264 ÷ 2 = 7 730 941 132 + 0;
  • 7 730 941 132 ÷ 2 = 3 865 470 566 + 0;
  • 3 865 470 566 ÷ 2 = 1 932 735 283 + 0;
  • 1 932 735 283 ÷ 2 = 966 367 641 + 1;
  • 966 367 641 ÷ 2 = 483 183 820 + 1;
  • 483 183 820 ÷ 2 = 241 591 910 + 0;
  • 241 591 910 ÷ 2 = 120 795 955 + 0;
  • 120 795 955 ÷ 2 = 60 397 977 + 1;
  • 60 397 977 ÷ 2 = 30 198 988 + 1;
  • 30 198 988 ÷ 2 = 15 099 494 + 0;
  • 15 099 494 ÷ 2 = 7 549 747 + 0;
  • 7 549 747 ÷ 2 = 3 774 873 + 1;
  • 3 774 873 ÷ 2 = 1 887 436 + 1;
  • 1 887 436 ÷ 2 = 943 718 + 0;
  • 943 718 ÷ 2 = 471 859 + 0;
  • 471 859 ÷ 2 = 235 929 + 1;
  • 235 929 ÷ 2 = 117 964 + 1;
  • 117 964 ÷ 2 = 58 982 + 0;
  • 58 982 ÷ 2 = 29 491 + 0;
  • 29 491 ÷ 2 = 14 745 + 1;
  • 14 745 ÷ 2 = 7 372 + 1;
  • 7 372 ÷ 2 = 3 686 + 0;
  • 3 686 ÷ 2 = 1 843 + 0;
  • 1 843 ÷ 2 = 921 + 1;
  • 921 ÷ 2 = 460 + 1;
  • 460 ÷ 2 = 230 + 0;
  • 230 ÷ 2 = 115 + 0;
  • 115 ÷ 2 = 57 + 1;
  • 57 ÷ 2 = 28 + 1;
  • 28 ÷ 2 = 14 + 0;
  • 14 ÷ 2 = 7 + 0;
  • 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.

15 832 967 439 219(10) = 1110 0110 0110 0110 0110 0110 0110 0110 0011 0111 0011(2)


4. Determine the signed binary number bit length:

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

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

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:


15 832 967 439 219(10) = 0000 0000 0000 0000 0000 1110 0110 0110 0110 0110 0110 0110 0110 0011 0111 0011

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


-15 832 967 439 219(10) Base 10 integer number converted and written as a signed binary code (in base 2):

-15 832 967 439 219(10) = 1000 0000 0000 0000 0000 1110 0110 0110 0110 0110 0110 0110 0110 0011 0111 0011

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

Share

» More ops: Convert -15 832 967 439 261, 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 08, 2026 [August]: Signed base 10 integer numbers converted and written as signed binary code. Calculations performed during the month of: August - by our visitors

» Improve your social skills: Reputation: Bridge Between Company's Actions & Market Value. Gemini Notebook YouTube Video of 6.55 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