Convert 10 001 000 011 110 091 to a Signed Binary (Base 2)

How to convert 10 001 000 011 110 091(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 10 001 000 011 110 091 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;
  • 10 001 000 011 110 091 ÷ 2 = 5 000 500 005 555 045 + 1;
  • 5 000 500 005 555 045 ÷ 2 = 2 500 250 002 777 522 + 1;
  • 2 500 250 002 777 522 ÷ 2 = 1 250 125 001 388 761 + 0;
  • 1 250 125 001 388 761 ÷ 2 = 625 062 500 694 380 + 1;
  • 625 062 500 694 380 ÷ 2 = 312 531 250 347 190 + 0;
  • 312 531 250 347 190 ÷ 2 = 156 265 625 173 595 + 0;
  • 156 265 625 173 595 ÷ 2 = 78 132 812 586 797 + 1;
  • 78 132 812 586 797 ÷ 2 = 39 066 406 293 398 + 1;
  • 39 066 406 293 398 ÷ 2 = 19 533 203 146 699 + 0;
  • 19 533 203 146 699 ÷ 2 = 9 766 601 573 349 + 1;
  • 9 766 601 573 349 ÷ 2 = 4 883 300 786 674 + 1;
  • 4 883 300 786 674 ÷ 2 = 2 441 650 393 337 + 0;
  • 2 441 650 393 337 ÷ 2 = 1 220 825 196 668 + 1;
  • 1 220 825 196 668 ÷ 2 = 610 412 598 334 + 0;
  • 610 412 598 334 ÷ 2 = 305 206 299 167 + 0;
  • 305 206 299 167 ÷ 2 = 152 603 149 583 + 1;
  • 152 603 149 583 ÷ 2 = 76 301 574 791 + 1;
  • 76 301 574 791 ÷ 2 = 38 150 787 395 + 1;
  • 38 150 787 395 ÷ 2 = 19 075 393 697 + 1;
  • 19 075 393 697 ÷ 2 = 9 537 696 848 + 1;
  • 9 537 696 848 ÷ 2 = 4 768 848 424 + 0;
  • 4 768 848 424 ÷ 2 = 2 384 424 212 + 0;
  • 2 384 424 212 ÷ 2 = 1 192 212 106 + 0;
  • 1 192 212 106 ÷ 2 = 596 106 053 + 0;
  • 596 106 053 ÷ 2 = 298 053 026 + 1;
  • 298 053 026 ÷ 2 = 149 026 513 + 0;
  • 149 026 513 ÷ 2 = 74 513 256 + 1;
  • 74 513 256 ÷ 2 = 37 256 628 + 0;
  • 37 256 628 ÷ 2 = 18 628 314 + 0;
  • 18 628 314 ÷ 2 = 9 314 157 + 0;
  • 9 314 157 ÷ 2 = 4 657 078 + 1;
  • 4 657 078 ÷ 2 = 2 328 539 + 0;
  • 2 328 539 ÷ 2 = 1 164 269 + 1;
  • 1 164 269 ÷ 2 = 582 134 + 1;
  • 582 134 ÷ 2 = 291 067 + 0;
  • 291 067 ÷ 2 = 145 533 + 1;
  • 145 533 ÷ 2 = 72 766 + 1;
  • 72 766 ÷ 2 = 36 383 + 0;
  • 36 383 ÷ 2 = 18 191 + 1;
  • 18 191 ÷ 2 = 9 095 + 1;
  • 9 095 ÷ 2 = 4 547 + 1;
  • 4 547 ÷ 2 = 2 273 + 1;
  • 2 273 ÷ 2 = 1 136 + 1;
  • 1 136 ÷ 2 = 568 + 0;
  • 568 ÷ 2 = 284 + 0;
  • 284 ÷ 2 = 142 + 0;
  • 142 ÷ 2 = 71 + 0;
  • 71 ÷ 2 = 35 + 1;
  • 35 ÷ 2 = 17 + 1;
  • 17 ÷ 2 = 8 + 1;
  • 8 ÷ 2 = 4 + 0;
  • 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 001 000 011 110 091(10) = 10 0011 1000 0111 1101 1011 0100 0101 0000 1111 1001 0110 1100 1011(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:


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

10 001 000 011 110 091(10) = 0000 0000 0010 0011 1000 0111 1101 1011 0100 0101 0000 1111 1001 0110 1100 1011

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

Share

» More ops: Convert 10 001 000 011 110 140, 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: Are you using communication by design, or by default? NotebookLM YouTube Video of 6.33 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