Convert 1 000 010 001 110 115 to a Signed Binary (Base 2)

How to convert 1 000 010 001 110 115(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 1 000 010 001 110 115 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;
  • 1 000 010 001 110 115 ÷ 2 = 500 005 000 555 057 + 1;
  • 500 005 000 555 057 ÷ 2 = 250 002 500 277 528 + 1;
  • 250 002 500 277 528 ÷ 2 = 125 001 250 138 764 + 0;
  • 125 001 250 138 764 ÷ 2 = 62 500 625 069 382 + 0;
  • 62 500 625 069 382 ÷ 2 = 31 250 312 534 691 + 0;
  • 31 250 312 534 691 ÷ 2 = 15 625 156 267 345 + 1;
  • 15 625 156 267 345 ÷ 2 = 7 812 578 133 672 + 1;
  • 7 812 578 133 672 ÷ 2 = 3 906 289 066 836 + 0;
  • 3 906 289 066 836 ÷ 2 = 1 953 144 533 418 + 0;
  • 1 953 144 533 418 ÷ 2 = 976 572 266 709 + 0;
  • 976 572 266 709 ÷ 2 = 488 286 133 354 + 1;
  • 488 286 133 354 ÷ 2 = 244 143 066 677 + 0;
  • 244 143 066 677 ÷ 2 = 122 071 533 338 + 1;
  • 122 071 533 338 ÷ 2 = 61 035 766 669 + 0;
  • 61 035 766 669 ÷ 2 = 30 517 883 334 + 1;
  • 30 517 883 334 ÷ 2 = 15 258 941 667 + 0;
  • 15 258 941 667 ÷ 2 = 7 629 470 833 + 1;
  • 7 629 470 833 ÷ 2 = 3 814 735 416 + 1;
  • 3 814 735 416 ÷ 2 = 1 907 367 708 + 0;
  • 1 907 367 708 ÷ 2 = 953 683 854 + 0;
  • 953 683 854 ÷ 2 = 476 841 927 + 0;
  • 476 841 927 ÷ 2 = 238 420 963 + 1;
  • 238 420 963 ÷ 2 = 119 210 481 + 1;
  • 119 210 481 ÷ 2 = 59 605 240 + 1;
  • 59 605 240 ÷ 2 = 29 802 620 + 0;
  • 29 802 620 ÷ 2 = 14 901 310 + 0;
  • 14 901 310 ÷ 2 = 7 450 655 + 0;
  • 7 450 655 ÷ 2 = 3 725 327 + 1;
  • 3 725 327 ÷ 2 = 1 862 663 + 1;
  • 1 862 663 ÷ 2 = 931 331 + 1;
  • 931 331 ÷ 2 = 465 665 + 1;
  • 465 665 ÷ 2 = 232 832 + 1;
  • 232 832 ÷ 2 = 116 416 + 0;
  • 116 416 ÷ 2 = 58 208 + 0;
  • 58 208 ÷ 2 = 29 104 + 0;
  • 29 104 ÷ 2 = 14 552 + 0;
  • 14 552 ÷ 2 = 7 276 + 0;
  • 7 276 ÷ 2 = 3 638 + 0;
  • 3 638 ÷ 2 = 1 819 + 0;
  • 1 819 ÷ 2 = 909 + 1;
  • 909 ÷ 2 = 454 + 1;
  • 454 ÷ 2 = 227 + 0;
  • 227 ÷ 2 = 113 + 1;
  • 113 ÷ 2 = 56 + 1;
  • 56 ÷ 2 = 28 + 0;
  • 28 ÷ 2 = 14 + 0;
  • 14 ÷ 2 = 7 + 0;
  • 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.

1 000 010 001 110 115(10) = 11 1000 1101 1000 0000 1111 1000 1110 0011 0101 0100 0110 0011(2)


3. Determine the signed binary number bit length:

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

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

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:


1 000 010 001 110 115(10) Base 10 integer number converted and written as a signed binary code (in base 2):

1 000 010 001 110 115(10) = 0000 0000 0000 0011 1000 1101 1000 0000 1111 1000 1110 0011 0101 0100 0110 0011

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

Share

» More ops: Convert 1 000 010 001 110 128, 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 09, 2026 [September]: Signed base 10 integer numbers converted and written as signed binary code. Calculations performed during the month of: September - by our visitors

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