Convert 110 001 001 101 107 to a Signed Binary (Base 2)

How to convert 110 001 001 101 107(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 110 001 001 101 107 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;
  • 110 001 001 101 107 ÷ 2 = 55 000 500 550 553 + 1;
  • 55 000 500 550 553 ÷ 2 = 27 500 250 275 276 + 1;
  • 27 500 250 275 276 ÷ 2 = 13 750 125 137 638 + 0;
  • 13 750 125 137 638 ÷ 2 = 6 875 062 568 819 + 0;
  • 6 875 062 568 819 ÷ 2 = 3 437 531 284 409 + 1;
  • 3 437 531 284 409 ÷ 2 = 1 718 765 642 204 + 1;
  • 1 718 765 642 204 ÷ 2 = 859 382 821 102 + 0;
  • 859 382 821 102 ÷ 2 = 429 691 410 551 + 0;
  • 429 691 410 551 ÷ 2 = 214 845 705 275 + 1;
  • 214 845 705 275 ÷ 2 = 107 422 852 637 + 1;
  • 107 422 852 637 ÷ 2 = 53 711 426 318 + 1;
  • 53 711 426 318 ÷ 2 = 26 855 713 159 + 0;
  • 26 855 713 159 ÷ 2 = 13 427 856 579 + 1;
  • 13 427 856 579 ÷ 2 = 6 713 928 289 + 1;
  • 6 713 928 289 ÷ 2 = 3 356 964 144 + 1;
  • 3 356 964 144 ÷ 2 = 1 678 482 072 + 0;
  • 1 678 482 072 ÷ 2 = 839 241 036 + 0;
  • 839 241 036 ÷ 2 = 419 620 518 + 0;
  • 419 620 518 ÷ 2 = 209 810 259 + 0;
  • 209 810 259 ÷ 2 = 104 905 129 + 1;
  • 104 905 129 ÷ 2 = 52 452 564 + 1;
  • 52 452 564 ÷ 2 = 26 226 282 + 0;
  • 26 226 282 ÷ 2 = 13 113 141 + 0;
  • 13 113 141 ÷ 2 = 6 556 570 + 1;
  • 6 556 570 ÷ 2 = 3 278 285 + 0;
  • 3 278 285 ÷ 2 = 1 639 142 + 1;
  • 1 639 142 ÷ 2 = 819 571 + 0;
  • 819 571 ÷ 2 = 409 785 + 1;
  • 409 785 ÷ 2 = 204 892 + 1;
  • 204 892 ÷ 2 = 102 446 + 0;
  • 102 446 ÷ 2 = 51 223 + 0;
  • 51 223 ÷ 2 = 25 611 + 1;
  • 25 611 ÷ 2 = 12 805 + 1;
  • 12 805 ÷ 2 = 6 402 + 1;
  • 6 402 ÷ 2 = 3 201 + 0;
  • 3 201 ÷ 2 = 1 600 + 1;
  • 1 600 ÷ 2 = 800 + 0;
  • 800 ÷ 2 = 400 + 0;
  • 400 ÷ 2 = 200 + 0;
  • 200 ÷ 2 = 100 + 0;
  • 100 ÷ 2 = 50 + 0;
  • 50 ÷ 2 = 25 + 0;
  • 25 ÷ 2 = 12 + 1;
  • 12 ÷ 2 = 6 + 0;
  • 6 ÷ 2 = 3 + 0;
  • 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.

110 001 001 101 107(10) = 110 0100 0000 1011 1001 1010 1001 1000 0111 0111 0011 0011(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:


110 001 001 101 107(10) Base 10 integer number converted and written as a signed binary code (in base 2):

110 001 001 101 107(10) = 0000 0000 0000 0000 0110 0100 0000 1011 1001 1010 1001 1000 0111 0111 0011 0011

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

Share

» More ops: Convert 110 001 001 101 106, 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: Your greatest rival, your most powerful ally. NotebookLM YouTube Video of 7.54 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