Convert 1 111 110 101 100 824 to a Signed Binary (Base 2)

How to convert 1 111 110 101 100 824(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 111 110 101 100 824 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 111 110 101 100 824 ÷ 2 = 555 555 050 550 412 + 0;
  • 555 555 050 550 412 ÷ 2 = 277 777 525 275 206 + 0;
  • 277 777 525 275 206 ÷ 2 = 138 888 762 637 603 + 0;
  • 138 888 762 637 603 ÷ 2 = 69 444 381 318 801 + 1;
  • 69 444 381 318 801 ÷ 2 = 34 722 190 659 400 + 1;
  • 34 722 190 659 400 ÷ 2 = 17 361 095 329 700 + 0;
  • 17 361 095 329 700 ÷ 2 = 8 680 547 664 850 + 0;
  • 8 680 547 664 850 ÷ 2 = 4 340 273 832 425 + 0;
  • 4 340 273 832 425 ÷ 2 = 2 170 136 916 212 + 1;
  • 2 170 136 916 212 ÷ 2 = 1 085 068 458 106 + 0;
  • 1 085 068 458 106 ÷ 2 = 542 534 229 053 + 0;
  • 542 534 229 053 ÷ 2 = 271 267 114 526 + 1;
  • 271 267 114 526 ÷ 2 = 135 633 557 263 + 0;
  • 135 633 557 263 ÷ 2 = 67 816 778 631 + 1;
  • 67 816 778 631 ÷ 2 = 33 908 389 315 + 1;
  • 33 908 389 315 ÷ 2 = 16 954 194 657 + 1;
  • 16 954 194 657 ÷ 2 = 8 477 097 328 + 1;
  • 8 477 097 328 ÷ 2 = 4 238 548 664 + 0;
  • 4 238 548 664 ÷ 2 = 2 119 274 332 + 0;
  • 2 119 274 332 ÷ 2 = 1 059 637 166 + 0;
  • 1 059 637 166 ÷ 2 = 529 818 583 + 0;
  • 529 818 583 ÷ 2 = 264 909 291 + 1;
  • 264 909 291 ÷ 2 = 132 454 645 + 1;
  • 132 454 645 ÷ 2 = 66 227 322 + 1;
  • 66 227 322 ÷ 2 = 33 113 661 + 0;
  • 33 113 661 ÷ 2 = 16 556 830 + 1;
  • 16 556 830 ÷ 2 = 8 278 415 + 0;
  • 8 278 415 ÷ 2 = 4 139 207 + 1;
  • 4 139 207 ÷ 2 = 2 069 603 + 1;
  • 2 069 603 ÷ 2 = 1 034 801 + 1;
  • 1 034 801 ÷ 2 = 517 400 + 1;
  • 517 400 ÷ 2 = 258 700 + 0;
  • 258 700 ÷ 2 = 129 350 + 0;
  • 129 350 ÷ 2 = 64 675 + 0;
  • 64 675 ÷ 2 = 32 337 + 1;
  • 32 337 ÷ 2 = 16 168 + 1;
  • 16 168 ÷ 2 = 8 084 + 0;
  • 8 084 ÷ 2 = 4 042 + 0;
  • 4 042 ÷ 2 = 2 021 + 0;
  • 2 021 ÷ 2 = 1 010 + 1;
  • 1 010 ÷ 2 = 505 + 0;
  • 505 ÷ 2 = 252 + 1;
  • 252 ÷ 2 = 126 + 0;
  • 126 ÷ 2 = 63 + 0;
  • 63 ÷ 2 = 31 + 1;
  • 31 ÷ 2 = 15 + 1;
  • 15 ÷ 2 = 7 + 1;
  • 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 111 110 101 100 824(10) = 11 1111 0010 1000 1100 0111 1010 1110 0001 1110 1001 0001 1000(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 111 110 101 100 824(10) Base 10 integer number converted and written as a signed binary code (in base 2):

1 111 110 101 100 824(10) = 0000 0000 0000 0011 1111 0010 1000 1100 0111 1010 1110 0001 1110 1001 0001 1000

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

» More ops: Convert 1 111 110 101 100 846, 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