Convert 10 247 448 371 277 to a Signed Binary (Base 2)

How to convert 10 247 448 371 277(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 10 247 448 371 277 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;
  • 10 247 448 371 277 ÷ 2 = 5 123 724 185 638 + 1;
  • 5 123 724 185 638 ÷ 2 = 2 561 862 092 819 + 0;
  • 2 561 862 092 819 ÷ 2 = 1 280 931 046 409 + 1;
  • 1 280 931 046 409 ÷ 2 = 640 465 523 204 + 1;
  • 640 465 523 204 ÷ 2 = 320 232 761 602 + 0;
  • 320 232 761 602 ÷ 2 = 160 116 380 801 + 0;
  • 160 116 380 801 ÷ 2 = 80 058 190 400 + 1;
  • 80 058 190 400 ÷ 2 = 40 029 095 200 + 0;
  • 40 029 095 200 ÷ 2 = 20 014 547 600 + 0;
  • 20 014 547 600 ÷ 2 = 10 007 273 800 + 0;
  • 10 007 273 800 ÷ 2 = 5 003 636 900 + 0;
  • 5 003 636 900 ÷ 2 = 2 501 818 450 + 0;
  • 2 501 818 450 ÷ 2 = 1 250 909 225 + 0;
  • 1 250 909 225 ÷ 2 = 625 454 612 + 1;
  • 625 454 612 ÷ 2 = 312 727 306 + 0;
  • 312 727 306 ÷ 2 = 156 363 653 + 0;
  • 156 363 653 ÷ 2 = 78 181 826 + 1;
  • 78 181 826 ÷ 2 = 39 090 913 + 0;
  • 39 090 913 ÷ 2 = 19 545 456 + 1;
  • 19 545 456 ÷ 2 = 9 772 728 + 0;
  • 9 772 728 ÷ 2 = 4 886 364 + 0;
  • 4 886 364 ÷ 2 = 2 443 182 + 0;
  • 2 443 182 ÷ 2 = 1 221 591 + 0;
  • 1 221 591 ÷ 2 = 610 795 + 1;
  • 610 795 ÷ 2 = 305 397 + 1;
  • 305 397 ÷ 2 = 152 698 + 1;
  • 152 698 ÷ 2 = 76 349 + 0;
  • 76 349 ÷ 2 = 38 174 + 1;
  • 38 174 ÷ 2 = 19 087 + 0;
  • 19 087 ÷ 2 = 9 543 + 1;
  • 9 543 ÷ 2 = 4 771 + 1;
  • 4 771 ÷ 2 = 2 385 + 1;
  • 2 385 ÷ 2 = 1 192 + 1;
  • 1 192 ÷ 2 = 596 + 0;
  • 596 ÷ 2 = 298 + 0;
  • 298 ÷ 2 = 149 + 0;
  • 149 ÷ 2 = 74 + 1;
  • 74 ÷ 2 = 37 + 0;
  • 37 ÷ 2 = 18 + 1;
  • 18 ÷ 2 = 9 + 0;
  • 9 ÷ 2 = 4 + 1;
  • 4 ÷ 2 = 2 + 0;
  • 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.

10 247 448 371 277(10) = 1001 0101 0001 1110 1011 1000 0101 0010 0000 0100 1101(2)


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


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:


10 247 448 371 277(10) Base 10 integer number converted and written as a signed binary code (in base 2):

10 247 448 371 277(10) = 0000 0000 0000 0000 0000 1001 0101 0001 1110 1011 1000 0101 0010 0000 0100 1101

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

Share

» More ops: Convert 10 247 448 371 266, 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 09, 2026 [September]: Signed base 10 integer numbers converted and written as signed binary code. Calculations performed during the month of: September - by our visitors

» Improve your social skills: The Attention Economy - The Battlefield For Your Focus. Gemini Notebook YouTube Video of 7.50 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