Convert -501 774 181 823 to a Signed Binary (Base 2)

How to convert -501 774 181 823(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 -501 774 181 823 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:

|-501 774 181 823| = 501 774 181 823

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;
  • 501 774 181 823 ÷ 2 = 250 887 090 911 + 1;
  • 250 887 090 911 ÷ 2 = 125 443 545 455 + 1;
  • 125 443 545 455 ÷ 2 = 62 721 772 727 + 1;
  • 62 721 772 727 ÷ 2 = 31 360 886 363 + 1;
  • 31 360 886 363 ÷ 2 = 15 680 443 181 + 1;
  • 15 680 443 181 ÷ 2 = 7 840 221 590 + 1;
  • 7 840 221 590 ÷ 2 = 3 920 110 795 + 0;
  • 3 920 110 795 ÷ 2 = 1 960 055 397 + 1;
  • 1 960 055 397 ÷ 2 = 980 027 698 + 1;
  • 980 027 698 ÷ 2 = 490 013 849 + 0;
  • 490 013 849 ÷ 2 = 245 006 924 + 1;
  • 245 006 924 ÷ 2 = 122 503 462 + 0;
  • 122 503 462 ÷ 2 = 61 251 731 + 0;
  • 61 251 731 ÷ 2 = 30 625 865 + 1;
  • 30 625 865 ÷ 2 = 15 312 932 + 1;
  • 15 312 932 ÷ 2 = 7 656 466 + 0;
  • 7 656 466 ÷ 2 = 3 828 233 + 0;
  • 3 828 233 ÷ 2 = 1 914 116 + 1;
  • 1 914 116 ÷ 2 = 957 058 + 0;
  • 957 058 ÷ 2 = 478 529 + 0;
  • 478 529 ÷ 2 = 239 264 + 1;
  • 239 264 ÷ 2 = 119 632 + 0;
  • 119 632 ÷ 2 = 59 816 + 0;
  • 59 816 ÷ 2 = 29 908 + 0;
  • 29 908 ÷ 2 = 14 954 + 0;
  • 14 954 ÷ 2 = 7 477 + 0;
  • 7 477 ÷ 2 = 3 738 + 1;
  • 3 738 ÷ 2 = 1 869 + 0;
  • 1 869 ÷ 2 = 934 + 1;
  • 934 ÷ 2 = 467 + 0;
  • 467 ÷ 2 = 233 + 1;
  • 233 ÷ 2 = 116 + 1;
  • 116 ÷ 2 = 58 + 0;
  • 58 ÷ 2 = 29 + 0;
  • 29 ÷ 2 = 14 + 1;
  • 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.

501 774 181 823(10) = 111 0100 1101 0100 0001 0010 0110 0101 1011 1111(2)


4. Determine the signed binary number bit length:

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

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

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:


501 774 181 823(10) = 0000 0000 0000 0000 0000 0000 0111 0100 1101 0100 0001 0010 0110 0101 1011 1111

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


-501 774 181 823(10) Base 10 integer number converted and written as a signed binary code (in base 2):

-501 774 181 823(10) = 1000 0000 0000 0000 0000 0000 0111 0100 1101 0100 0001 0010 0110 0101 1011 1111

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

» More ops: Convert -501 774 181 789, 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