Convert 111 101 010 109 720 to a Signed Binary (Base 2)

How to convert 111 101 010 109 720(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 111 101 010 109 720 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;
  • 111 101 010 109 720 ÷ 2 = 55 550 505 054 860 + 0;
  • 55 550 505 054 860 ÷ 2 = 27 775 252 527 430 + 0;
  • 27 775 252 527 430 ÷ 2 = 13 887 626 263 715 + 0;
  • 13 887 626 263 715 ÷ 2 = 6 943 813 131 857 + 1;
  • 6 943 813 131 857 ÷ 2 = 3 471 906 565 928 + 1;
  • 3 471 906 565 928 ÷ 2 = 1 735 953 282 964 + 0;
  • 1 735 953 282 964 ÷ 2 = 867 976 641 482 + 0;
  • 867 976 641 482 ÷ 2 = 433 988 320 741 + 0;
  • 433 988 320 741 ÷ 2 = 216 994 160 370 + 1;
  • 216 994 160 370 ÷ 2 = 108 497 080 185 + 0;
  • 108 497 080 185 ÷ 2 = 54 248 540 092 + 1;
  • 54 248 540 092 ÷ 2 = 27 124 270 046 + 0;
  • 27 124 270 046 ÷ 2 = 13 562 135 023 + 0;
  • 13 562 135 023 ÷ 2 = 6 781 067 511 + 1;
  • 6 781 067 511 ÷ 2 = 3 390 533 755 + 1;
  • 3 390 533 755 ÷ 2 = 1 695 266 877 + 1;
  • 1 695 266 877 ÷ 2 = 847 633 438 + 1;
  • 847 633 438 ÷ 2 = 423 816 719 + 0;
  • 423 816 719 ÷ 2 = 211 908 359 + 1;
  • 211 908 359 ÷ 2 = 105 954 179 + 1;
  • 105 954 179 ÷ 2 = 52 977 089 + 1;
  • 52 977 089 ÷ 2 = 26 488 544 + 1;
  • 26 488 544 ÷ 2 = 13 244 272 + 0;
  • 13 244 272 ÷ 2 = 6 622 136 + 0;
  • 6 622 136 ÷ 2 = 3 311 068 + 0;
  • 3 311 068 ÷ 2 = 1 655 534 + 0;
  • 1 655 534 ÷ 2 = 827 767 + 0;
  • 827 767 ÷ 2 = 413 883 + 1;
  • 413 883 ÷ 2 = 206 941 + 1;
  • 206 941 ÷ 2 = 103 470 + 1;
  • 103 470 ÷ 2 = 51 735 + 0;
  • 51 735 ÷ 2 = 25 867 + 1;
  • 25 867 ÷ 2 = 12 933 + 1;
  • 12 933 ÷ 2 = 6 466 + 1;
  • 6 466 ÷ 2 = 3 233 + 0;
  • 3 233 ÷ 2 = 1 616 + 1;
  • 1 616 ÷ 2 = 808 + 0;
  • 808 ÷ 2 = 404 + 0;
  • 404 ÷ 2 = 202 + 0;
  • 202 ÷ 2 = 101 + 0;
  • 101 ÷ 2 = 50 + 1;
  • 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.

111 101 010 109 720(10) = 110 0101 0000 1011 1011 1000 0011 1101 1110 0101 0001 1000(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:


111 101 010 109 720(10) Base 10 integer number converted and written as a signed binary code (in base 2):

111 101 010 109 720(10) = 0000 0000 0000 0000 0110 0101 0000 1011 1011 1000 0011 1101 1110 0101 0001 1000

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

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

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