Signed: Integer ↗ Binary: 1 011 111 110 009 935 Convert the Integer Number to a Signed Binary. Converting and Writing the Base Ten Decimal System Signed Integer as Binary Code (Written in Base Two)

Signed integer number 1 011 111 110 009 935(10)
converted and written as a signed binary (base 2) = ?

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;
  • 1 011 111 110 009 935 ÷ 2 = 505 555 555 004 967 + 1;
  • 505 555 555 004 967 ÷ 2 = 252 777 777 502 483 + 1;
  • 252 777 777 502 483 ÷ 2 = 126 388 888 751 241 + 1;
  • 126 388 888 751 241 ÷ 2 = 63 194 444 375 620 + 1;
  • 63 194 444 375 620 ÷ 2 = 31 597 222 187 810 + 0;
  • 31 597 222 187 810 ÷ 2 = 15 798 611 093 905 + 0;
  • 15 798 611 093 905 ÷ 2 = 7 899 305 546 952 + 1;
  • 7 899 305 546 952 ÷ 2 = 3 949 652 773 476 + 0;
  • 3 949 652 773 476 ÷ 2 = 1 974 826 386 738 + 0;
  • 1 974 826 386 738 ÷ 2 = 987 413 193 369 + 0;
  • 987 413 193 369 ÷ 2 = 493 706 596 684 + 1;
  • 493 706 596 684 ÷ 2 = 246 853 298 342 + 0;
  • 246 853 298 342 ÷ 2 = 123 426 649 171 + 0;
  • 123 426 649 171 ÷ 2 = 61 713 324 585 + 1;
  • 61 713 324 585 ÷ 2 = 30 856 662 292 + 1;
  • 30 856 662 292 ÷ 2 = 15 428 331 146 + 0;
  • 15 428 331 146 ÷ 2 = 7 714 165 573 + 0;
  • 7 714 165 573 ÷ 2 = 3 857 082 786 + 1;
  • 3 857 082 786 ÷ 2 = 1 928 541 393 + 0;
  • 1 928 541 393 ÷ 2 = 964 270 696 + 1;
  • 964 270 696 ÷ 2 = 482 135 348 + 0;
  • 482 135 348 ÷ 2 = 241 067 674 + 0;
  • 241 067 674 ÷ 2 = 120 533 837 + 0;
  • 120 533 837 ÷ 2 = 60 266 918 + 1;
  • 60 266 918 ÷ 2 = 30 133 459 + 0;
  • 30 133 459 ÷ 2 = 15 066 729 + 1;
  • 15 066 729 ÷ 2 = 7 533 364 + 1;
  • 7 533 364 ÷ 2 = 3 766 682 + 0;
  • 3 766 682 ÷ 2 = 1 883 341 + 0;
  • 1 883 341 ÷ 2 = 941 670 + 1;
  • 941 670 ÷ 2 = 470 835 + 0;
  • 470 835 ÷ 2 = 235 417 + 1;
  • 235 417 ÷ 2 = 117 708 + 1;
  • 117 708 ÷ 2 = 58 854 + 0;
  • 58 854 ÷ 2 = 29 427 + 0;
  • 29 427 ÷ 2 = 14 713 + 1;
  • 14 713 ÷ 2 = 7 356 + 1;
  • 7 356 ÷ 2 = 3 678 + 0;
  • 3 678 ÷ 2 = 1 839 + 0;
  • 1 839 ÷ 2 = 919 + 1;
  • 919 ÷ 2 = 459 + 1;
  • 459 ÷ 2 = 229 + 1;
  • 229 ÷ 2 = 114 + 1;
  • 114 ÷ 2 = 57 + 0;
  • 57 ÷ 2 = 28 + 1;
  • 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 011 111 110 009 935(10) = 11 1001 0111 1001 1001 1010 0110 1000 1010 0110 0100 0100 1111(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:


Number 1 011 111 110 009 935(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):

1 011 111 110 009 935(10) = 0000 0000 0000 0011 1001 0111 1001 1001 1010 0110 1000 1010 0110 0100 0100 1111

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

More operations on signed integer numbers:

» Signed integer number 1 011 111 110 009 934 converted from decimal system (from base 10) and written as a signed binary (in base 2) = ?

» Signed integer number 1 011 111 110 009 936 converted from decimal system (from base 10) and written as a signed binary (in base 2) = ?

The latest signed integer numbers (that are written in decimal system, in base ten) converted and written as signed binary numbers

Convert the base ten decimal system integer number 1,000,000,000,000,000,060, write it as a signed binary written in base two May 17 08:14 UTC (GMT)
Convert the base ten decimal system integer number 111,110,011,062, write it as a signed binary written in base two May 17 08:14 UTC (GMT)
Convert the base ten decimal system integer number 42,949,672,994, write it as a signed binary written in base two May 17 08:14 UTC (GMT)
Convert the base ten decimal system integer number -2,147,479,679, write it as a signed binary written in base two May 17 08:14 UTC (GMT)
Convert the base ten decimal system integer number -10,203,035, write it as a signed binary written in base two May 17 08:13 UTC (GMT)
Convert the base ten decimal system integer number -111,010,100,017, write it as a signed binary written in base two May 17 08:13 UTC (GMT)
Convert the base ten decimal system integer number 18,846, write it as a signed binary written in base two May 17 08:13 UTC (GMT)
Convert the base ten decimal system integer number -4,715, write it as a signed binary written in base two May 17 08:12 UTC (GMT)
Convert the base ten decimal system integer number 50,000,000,000,000, write it as a signed binary written in base two May 17 08:12 UTC (GMT)
Convert the base ten decimal system integer number 140,633, write it as a signed binary written in base two May 17 08:12 UTC (GMT)
All the decimal system integer numbers (written in base ten) converted and written as signed binary numbers

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