Convert 100 101 010 099 577 to a Signed Binary (Base 2)

How to convert 100 101 010 099 577(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 100 101 010 099 577 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;
  • 100 101 010 099 577 ÷ 2 = 50 050 505 049 788 + 1;
  • 50 050 505 049 788 ÷ 2 = 25 025 252 524 894 + 0;
  • 25 025 252 524 894 ÷ 2 = 12 512 626 262 447 + 0;
  • 12 512 626 262 447 ÷ 2 = 6 256 313 131 223 + 1;
  • 6 256 313 131 223 ÷ 2 = 3 128 156 565 611 + 1;
  • 3 128 156 565 611 ÷ 2 = 1 564 078 282 805 + 1;
  • 1 564 078 282 805 ÷ 2 = 782 039 141 402 + 1;
  • 782 039 141 402 ÷ 2 = 391 019 570 701 + 0;
  • 391 019 570 701 ÷ 2 = 195 509 785 350 + 1;
  • 195 509 785 350 ÷ 2 = 97 754 892 675 + 0;
  • 97 754 892 675 ÷ 2 = 48 877 446 337 + 1;
  • 48 877 446 337 ÷ 2 = 24 438 723 168 + 1;
  • 24 438 723 168 ÷ 2 = 12 219 361 584 + 0;
  • 12 219 361 584 ÷ 2 = 6 109 680 792 + 0;
  • 6 109 680 792 ÷ 2 = 3 054 840 396 + 0;
  • 3 054 840 396 ÷ 2 = 1 527 420 198 + 0;
  • 1 527 420 198 ÷ 2 = 763 710 099 + 0;
  • 763 710 099 ÷ 2 = 381 855 049 + 1;
  • 381 855 049 ÷ 2 = 190 927 524 + 1;
  • 190 927 524 ÷ 2 = 95 463 762 + 0;
  • 95 463 762 ÷ 2 = 47 731 881 + 0;
  • 47 731 881 ÷ 2 = 23 865 940 + 1;
  • 23 865 940 ÷ 2 = 11 932 970 + 0;
  • 11 932 970 ÷ 2 = 5 966 485 + 0;
  • 5 966 485 ÷ 2 = 2 983 242 + 1;
  • 2 983 242 ÷ 2 = 1 491 621 + 0;
  • 1 491 621 ÷ 2 = 745 810 + 1;
  • 745 810 ÷ 2 = 372 905 + 0;
  • 372 905 ÷ 2 = 186 452 + 1;
  • 186 452 ÷ 2 = 93 226 + 0;
  • 93 226 ÷ 2 = 46 613 + 0;
  • 46 613 ÷ 2 = 23 306 + 1;
  • 23 306 ÷ 2 = 11 653 + 0;
  • 11 653 ÷ 2 = 5 826 + 1;
  • 5 826 ÷ 2 = 2 913 + 0;
  • 2 913 ÷ 2 = 1 456 + 1;
  • 1 456 ÷ 2 = 728 + 0;
  • 728 ÷ 2 = 364 + 0;
  • 364 ÷ 2 = 182 + 0;
  • 182 ÷ 2 = 91 + 0;
  • 91 ÷ 2 = 45 + 1;
  • 45 ÷ 2 = 22 + 1;
  • 22 ÷ 2 = 11 + 0;
  • 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.

100 101 010 099 577(10) = 101 1011 0000 1010 1001 0101 0010 0110 0000 1101 0111 1001(2)


3. Determine the signed binary number bit length:

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

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

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:


100 101 010 099 577(10) Base 10 integer number converted and written as a signed binary code (in base 2):

100 101 010 099 577(10) = 0000 0000 0000 0000 0101 1011 0000 1010 1001 0101 0010 0110 0000 1101 0111 1001

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

Share

» More ops: Convert 100 101 010 099 542, 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 04, 2026 [April]: Signed base 10 integer numbers converted and written as signed binary code. Calculations performed during the month of: April - by our visitors

» Improve your social skills: Reputation: Bridge Between Company's Actions and Market Value. NotebookLM 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