Convert 8 945 732 563 140 275 to a Signed Binary (Base 2)

How to convert 8 945 732 563 140 275(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 8 945 732 563 140 275 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;
  • 8 945 732 563 140 275 ÷ 2 = 4 472 866 281 570 137 + 1;
  • 4 472 866 281 570 137 ÷ 2 = 2 236 433 140 785 068 + 1;
  • 2 236 433 140 785 068 ÷ 2 = 1 118 216 570 392 534 + 0;
  • 1 118 216 570 392 534 ÷ 2 = 559 108 285 196 267 + 0;
  • 559 108 285 196 267 ÷ 2 = 279 554 142 598 133 + 1;
  • 279 554 142 598 133 ÷ 2 = 139 777 071 299 066 + 1;
  • 139 777 071 299 066 ÷ 2 = 69 888 535 649 533 + 0;
  • 69 888 535 649 533 ÷ 2 = 34 944 267 824 766 + 1;
  • 34 944 267 824 766 ÷ 2 = 17 472 133 912 383 + 0;
  • 17 472 133 912 383 ÷ 2 = 8 736 066 956 191 + 1;
  • 8 736 066 956 191 ÷ 2 = 4 368 033 478 095 + 1;
  • 4 368 033 478 095 ÷ 2 = 2 184 016 739 047 + 1;
  • 2 184 016 739 047 ÷ 2 = 1 092 008 369 523 + 1;
  • 1 092 008 369 523 ÷ 2 = 546 004 184 761 + 1;
  • 546 004 184 761 ÷ 2 = 273 002 092 380 + 1;
  • 273 002 092 380 ÷ 2 = 136 501 046 190 + 0;
  • 136 501 046 190 ÷ 2 = 68 250 523 095 + 0;
  • 68 250 523 095 ÷ 2 = 34 125 261 547 + 1;
  • 34 125 261 547 ÷ 2 = 17 062 630 773 + 1;
  • 17 062 630 773 ÷ 2 = 8 531 315 386 + 1;
  • 8 531 315 386 ÷ 2 = 4 265 657 693 + 0;
  • 4 265 657 693 ÷ 2 = 2 132 828 846 + 1;
  • 2 132 828 846 ÷ 2 = 1 066 414 423 + 0;
  • 1 066 414 423 ÷ 2 = 533 207 211 + 1;
  • 533 207 211 ÷ 2 = 266 603 605 + 1;
  • 266 603 605 ÷ 2 = 133 301 802 + 1;
  • 133 301 802 ÷ 2 = 66 650 901 + 0;
  • 66 650 901 ÷ 2 = 33 325 450 + 1;
  • 33 325 450 ÷ 2 = 16 662 725 + 0;
  • 16 662 725 ÷ 2 = 8 331 362 + 1;
  • 8 331 362 ÷ 2 = 4 165 681 + 0;
  • 4 165 681 ÷ 2 = 2 082 840 + 1;
  • 2 082 840 ÷ 2 = 1 041 420 + 0;
  • 1 041 420 ÷ 2 = 520 710 + 0;
  • 520 710 ÷ 2 = 260 355 + 0;
  • 260 355 ÷ 2 = 130 177 + 1;
  • 130 177 ÷ 2 = 65 088 + 1;
  • 65 088 ÷ 2 = 32 544 + 0;
  • 32 544 ÷ 2 = 16 272 + 0;
  • 16 272 ÷ 2 = 8 136 + 0;
  • 8 136 ÷ 2 = 4 068 + 0;
  • 4 068 ÷ 2 = 2 034 + 0;
  • 2 034 ÷ 2 = 1 017 + 0;
  • 1 017 ÷ 2 = 508 + 1;
  • 508 ÷ 2 = 254 + 0;
  • 254 ÷ 2 = 127 + 0;
  • 127 ÷ 2 = 63 + 1;
  • 63 ÷ 2 = 31 + 1;
  • 31 ÷ 2 = 15 + 1;
  • 15 ÷ 2 = 7 + 1;
  • 7 ÷ 2 = 3 + 1;
  • 3 ÷ 2 = 1 + 1;
  • 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.

8 945 732 563 140 275(10) = 1 1111 1100 1000 0001 1000 1010 1011 1010 1110 0111 1110 1011 0011(2)


3. Determine the signed binary number bit length:

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

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

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:


8 945 732 563 140 275(10) Base 10 integer number converted and written as a signed binary code (in base 2):

8 945 732 563 140 275(10) = 0000 0000 0001 1111 1100 1000 0001 1000 1010 1011 1010 1110 0111 1110 1011 0011

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

Share

» More ops: Convert 8 945 732 563 140 281, 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 06, 2026 [June]: Signed base 10 integer numbers converted and written as signed binary code. Calculations performed during the month of: June - by our visitors

» Improve your social skills: Are you using communication by design, or by default? NotebookLM YouTube Video of 6.33 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