Convert 3 319 966 981 248 973 to a Signed Binary (Base 2)

How to convert 3 319 966 981 248 973(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 3 319 966 981 248 973 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. 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;
  • 3 319 966 981 248 973 ÷ 2 = 1 659 983 490 624 486 + 1;
  • 1 659 983 490 624 486 ÷ 2 = 829 991 745 312 243 + 0;
  • 829 991 745 312 243 ÷ 2 = 414 995 872 656 121 + 1;
  • 414 995 872 656 121 ÷ 2 = 207 497 936 328 060 + 1;
  • 207 497 936 328 060 ÷ 2 = 103 748 968 164 030 + 0;
  • 103 748 968 164 030 ÷ 2 = 51 874 484 082 015 + 0;
  • 51 874 484 082 015 ÷ 2 = 25 937 242 041 007 + 1;
  • 25 937 242 041 007 ÷ 2 = 12 968 621 020 503 + 1;
  • 12 968 621 020 503 ÷ 2 = 6 484 310 510 251 + 1;
  • 6 484 310 510 251 ÷ 2 = 3 242 155 255 125 + 1;
  • 3 242 155 255 125 ÷ 2 = 1 621 077 627 562 + 1;
  • 1 621 077 627 562 ÷ 2 = 810 538 813 781 + 0;
  • 810 538 813 781 ÷ 2 = 405 269 406 890 + 1;
  • 405 269 406 890 ÷ 2 = 202 634 703 445 + 0;
  • 202 634 703 445 ÷ 2 = 101 317 351 722 + 1;
  • 101 317 351 722 ÷ 2 = 50 658 675 861 + 0;
  • 50 658 675 861 ÷ 2 = 25 329 337 930 + 1;
  • 25 329 337 930 ÷ 2 = 12 664 668 965 + 0;
  • 12 664 668 965 ÷ 2 = 6 332 334 482 + 1;
  • 6 332 334 482 ÷ 2 = 3 166 167 241 + 0;
  • 3 166 167 241 ÷ 2 = 1 583 083 620 + 1;
  • 1 583 083 620 ÷ 2 = 791 541 810 + 0;
  • 791 541 810 ÷ 2 = 395 770 905 + 0;
  • 395 770 905 ÷ 2 = 197 885 452 + 1;
  • 197 885 452 ÷ 2 = 98 942 726 + 0;
  • 98 942 726 ÷ 2 = 49 471 363 + 0;
  • 49 471 363 ÷ 2 = 24 735 681 + 1;
  • 24 735 681 ÷ 2 = 12 367 840 + 1;
  • 12 367 840 ÷ 2 = 6 183 920 + 0;
  • 6 183 920 ÷ 2 = 3 091 960 + 0;
  • 3 091 960 ÷ 2 = 1 545 980 + 0;
  • 1 545 980 ÷ 2 = 772 990 + 0;
  • 772 990 ÷ 2 = 386 495 + 0;
  • 386 495 ÷ 2 = 193 247 + 1;
  • 193 247 ÷ 2 = 96 623 + 1;
  • 96 623 ÷ 2 = 48 311 + 1;
  • 48 311 ÷ 2 = 24 155 + 1;
  • 24 155 ÷ 2 = 12 077 + 1;
  • 12 077 ÷ 2 = 6 038 + 1;
  • 6 038 ÷ 2 = 3 019 + 0;
  • 3 019 ÷ 2 = 1 509 + 1;
  • 1 509 ÷ 2 = 754 + 1;
  • 754 ÷ 2 = 377 + 0;
  • 377 ÷ 2 = 188 + 1;
  • 188 ÷ 2 = 94 + 0;
  • 94 ÷ 2 = 47 + 0;
  • 47 ÷ 2 = 23 + 1;
  • 23 ÷ 2 = 11 + 1;
  • 11 ÷ 2 = 5 + 1;
  • 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.

3 319 966 981 248 973(10) = 1011 1100 1011 0111 1110 0000 1100 1001 0101 0101 0111 1100 1101(2)


3. Determine the signed binary number bit length:

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

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

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:


3 319 966 981 248 973(10) Base 10 integer number converted and written as a signed binary code (in base 2):

3 319 966 981 248 973(10) = 0000 0000 0000 1011 1100 1011 0111 1110 0000 1100 1001 0101 0101 0111 1100 1101

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

» More ops: Convert 3 319 966 981 248 986, 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