Integer to Signed Binary: Number 10 100 000 110 Converted and Written as a Signed Binary. Base Ten Decimal System Conversion

Integer number 10 100 000 110(10) written as a signed binary number

1. Divide the number repeatedly by 2:

Keep track of each remainder.

We stop when we get a quotient that is equal to zero.


  • division = quotient + remainder;
  • 10 100 000 110 ÷ 2 = 5 050 000 055 + 0;
  • 5 050 000 055 ÷ 2 = 2 525 000 027 + 1;
  • 2 525 000 027 ÷ 2 = 1 262 500 013 + 1;
  • 1 262 500 013 ÷ 2 = 631 250 006 + 1;
  • 631 250 006 ÷ 2 = 315 625 003 + 0;
  • 315 625 003 ÷ 2 = 157 812 501 + 1;
  • 157 812 501 ÷ 2 = 78 906 250 + 1;
  • 78 906 250 ÷ 2 = 39 453 125 + 0;
  • 39 453 125 ÷ 2 = 19 726 562 + 1;
  • 19 726 562 ÷ 2 = 9 863 281 + 0;
  • 9 863 281 ÷ 2 = 4 931 640 + 1;
  • 4 931 640 ÷ 2 = 2 465 820 + 0;
  • 2 465 820 ÷ 2 = 1 232 910 + 0;
  • 1 232 910 ÷ 2 = 616 455 + 0;
  • 616 455 ÷ 2 = 308 227 + 1;
  • 308 227 ÷ 2 = 154 113 + 1;
  • 154 113 ÷ 2 = 77 056 + 1;
  • 77 056 ÷ 2 = 38 528 + 0;
  • 38 528 ÷ 2 = 19 264 + 0;
  • 19 264 ÷ 2 = 9 632 + 0;
  • 9 632 ÷ 2 = 4 816 + 0;
  • 4 816 ÷ 2 = 2 408 + 0;
  • 2 408 ÷ 2 = 1 204 + 0;
  • 1 204 ÷ 2 = 602 + 0;
  • 602 ÷ 2 = 301 + 0;
  • 301 ÷ 2 = 150 + 1;
  • 150 ÷ 2 = 75 + 0;
  • 75 ÷ 2 = 37 + 1;
  • 37 ÷ 2 = 18 + 1;
  • 18 ÷ 2 = 9 + 0;
  • 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.

10 100 000 110(10) = 10 0101 1010 0000 0001 1100 0101 0110 1110(2)


3. Determine the signed binary number bit length:

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

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, 34,

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:


Number 10 100 000 110(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):

10 100 000 110(10) = 0000 0000 0000 0000 0000 0000 0000 0010 0101 1010 0000 0001 1100 0101 0110 1110

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

» More ops: Integer number 10 100 000 097 converted and written as a signed binary number

» New: All the Calculations Performed by Our Visitors: Integer numbers converted and written as signed binary numbers. Data organized on a Monthly Basis

» Month 03, 2025 [March]: Integer Numbers Converted and Written as Signed Binary. Monthly Calculations performed during the month of: March - by our visitors

How to convert signed integers from decimal system 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