Convert 11 111 111 111 111 374 to a Signed Binary (Base 2)

How to convert 11 111 111 111 111 374(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 11 111 111 111 111 374 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;
  • 11 111 111 111 111 374 ÷ 2 = 5 555 555 555 555 687 + 0;
  • 5 555 555 555 555 687 ÷ 2 = 2 777 777 777 777 843 + 1;
  • 2 777 777 777 777 843 ÷ 2 = 1 388 888 888 888 921 + 1;
  • 1 388 888 888 888 921 ÷ 2 = 694 444 444 444 460 + 1;
  • 694 444 444 444 460 ÷ 2 = 347 222 222 222 230 + 0;
  • 347 222 222 222 230 ÷ 2 = 173 611 111 111 115 + 0;
  • 173 611 111 111 115 ÷ 2 = 86 805 555 555 557 + 1;
  • 86 805 555 555 557 ÷ 2 = 43 402 777 777 778 + 1;
  • 43 402 777 777 778 ÷ 2 = 21 701 388 888 889 + 0;
  • 21 701 388 888 889 ÷ 2 = 10 850 694 444 444 + 1;
  • 10 850 694 444 444 ÷ 2 = 5 425 347 222 222 + 0;
  • 5 425 347 222 222 ÷ 2 = 2 712 673 611 111 + 0;
  • 2 712 673 611 111 ÷ 2 = 1 356 336 805 555 + 1;
  • 1 356 336 805 555 ÷ 2 = 678 168 402 777 + 1;
  • 678 168 402 777 ÷ 2 = 339 084 201 388 + 1;
  • 339 084 201 388 ÷ 2 = 169 542 100 694 + 0;
  • 169 542 100 694 ÷ 2 = 84 771 050 347 + 0;
  • 84 771 050 347 ÷ 2 = 42 385 525 173 + 1;
  • 42 385 525 173 ÷ 2 = 21 192 762 586 + 1;
  • 21 192 762 586 ÷ 2 = 10 596 381 293 + 0;
  • 10 596 381 293 ÷ 2 = 5 298 190 646 + 1;
  • 5 298 190 646 ÷ 2 = 2 649 095 323 + 0;
  • 2 649 095 323 ÷ 2 = 1 324 547 661 + 1;
  • 1 324 547 661 ÷ 2 = 662 273 830 + 1;
  • 662 273 830 ÷ 2 = 331 136 915 + 0;
  • 331 136 915 ÷ 2 = 165 568 457 + 1;
  • 165 568 457 ÷ 2 = 82 784 228 + 1;
  • 82 784 228 ÷ 2 = 41 392 114 + 0;
  • 41 392 114 ÷ 2 = 20 696 057 + 0;
  • 20 696 057 ÷ 2 = 10 348 028 + 1;
  • 10 348 028 ÷ 2 = 5 174 014 + 0;
  • 5 174 014 ÷ 2 = 2 587 007 + 0;
  • 2 587 007 ÷ 2 = 1 293 503 + 1;
  • 1 293 503 ÷ 2 = 646 751 + 1;
  • 646 751 ÷ 2 = 323 375 + 1;
  • 323 375 ÷ 2 = 161 687 + 1;
  • 161 687 ÷ 2 = 80 843 + 1;
  • 80 843 ÷ 2 = 40 421 + 1;
  • 40 421 ÷ 2 = 20 210 + 1;
  • 20 210 ÷ 2 = 10 105 + 0;
  • 10 105 ÷ 2 = 5 052 + 1;
  • 5 052 ÷ 2 = 2 526 + 0;
  • 2 526 ÷ 2 = 1 263 + 0;
  • 1 263 ÷ 2 = 631 + 1;
  • 631 ÷ 2 = 315 + 1;
  • 315 ÷ 2 = 157 + 1;
  • 157 ÷ 2 = 78 + 1;
  • 78 ÷ 2 = 39 + 0;
  • 39 ÷ 2 = 19 + 1;
  • 19 ÷ 2 = 9 + 1;
  • 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.

11 111 111 111 111 374(10) = 10 0111 0111 1001 0111 1111 0010 0110 1101 0110 0111 0010 1100 1110(2)


3. Determine the signed binary number bit length:

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

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

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:


11 111 111 111 111 374(10) Base 10 integer number converted and written as a signed binary code (in base 2):

11 111 111 111 111 374(10) = 0000 0000 0010 0111 0111 1001 0111 1111 0010 0110 1101 0110 0111 0010 1100 1110

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

Share

» More ops: Convert 11 111 111 111 111 355, 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 07, 2026 [July]: Signed base 10 integer numbers converted and written as signed binary code. Calculations performed during the month of: July - by our visitors

» Improve your social skills: The Hidden Requirement in Every Single Job Description. Gemini Notebook YouTube Video of 8.15 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