Convert 1 017 101 610 150 925 to a Signed Binary (Base 2)

How to convert 1 017 101 610 150 925(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 017 101 610 150 925 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 017 101 610 150 925 ÷ 2 = 508 550 805 075 462 + 1;
  • 508 550 805 075 462 ÷ 2 = 254 275 402 537 731 + 0;
  • 254 275 402 537 731 ÷ 2 = 127 137 701 268 865 + 1;
  • 127 137 701 268 865 ÷ 2 = 63 568 850 634 432 + 1;
  • 63 568 850 634 432 ÷ 2 = 31 784 425 317 216 + 0;
  • 31 784 425 317 216 ÷ 2 = 15 892 212 658 608 + 0;
  • 15 892 212 658 608 ÷ 2 = 7 946 106 329 304 + 0;
  • 7 946 106 329 304 ÷ 2 = 3 973 053 164 652 + 0;
  • 3 973 053 164 652 ÷ 2 = 1 986 526 582 326 + 0;
  • 1 986 526 582 326 ÷ 2 = 993 263 291 163 + 0;
  • 993 263 291 163 ÷ 2 = 496 631 645 581 + 1;
  • 496 631 645 581 ÷ 2 = 248 315 822 790 + 1;
  • 248 315 822 790 ÷ 2 = 124 157 911 395 + 0;
  • 124 157 911 395 ÷ 2 = 62 078 955 697 + 1;
  • 62 078 955 697 ÷ 2 = 31 039 477 848 + 1;
  • 31 039 477 848 ÷ 2 = 15 519 738 924 + 0;
  • 15 519 738 924 ÷ 2 = 7 759 869 462 + 0;
  • 7 759 869 462 ÷ 2 = 3 879 934 731 + 0;
  • 3 879 934 731 ÷ 2 = 1 939 967 365 + 1;
  • 1 939 967 365 ÷ 2 = 969 983 682 + 1;
  • 969 983 682 ÷ 2 = 484 991 841 + 0;
  • 484 991 841 ÷ 2 = 242 495 920 + 1;
  • 242 495 920 ÷ 2 = 121 247 960 + 0;
  • 121 247 960 ÷ 2 = 60 623 980 + 0;
  • 60 623 980 ÷ 2 = 30 311 990 + 0;
  • 30 311 990 ÷ 2 = 15 155 995 + 0;
  • 15 155 995 ÷ 2 = 7 577 997 + 1;
  • 7 577 997 ÷ 2 = 3 788 998 + 1;
  • 3 788 998 ÷ 2 = 1 894 499 + 0;
  • 1 894 499 ÷ 2 = 947 249 + 1;
  • 947 249 ÷ 2 = 473 624 + 1;
  • 473 624 ÷ 2 = 236 812 + 0;
  • 236 812 ÷ 2 = 118 406 + 0;
  • 118 406 ÷ 2 = 59 203 + 0;
  • 59 203 ÷ 2 = 29 601 + 1;
  • 29 601 ÷ 2 = 14 800 + 1;
  • 14 800 ÷ 2 = 7 400 + 0;
  • 7 400 ÷ 2 = 3 700 + 0;
  • 3 700 ÷ 2 = 1 850 + 0;
  • 1 850 ÷ 2 = 925 + 0;
  • 925 ÷ 2 = 462 + 1;
  • 462 ÷ 2 = 231 + 0;
  • 231 ÷ 2 = 115 + 1;
  • 115 ÷ 2 = 57 + 1;
  • 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 017 101 610 150 925(10) = 11 1001 1101 0000 1100 0110 1100 0010 1100 0110 1100 0000 1101(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 017 101 610 150 925(10) Base 10 integer number converted and written as a signed binary code (in base 2):

1 017 101 610 150 925(10) = 0000 0000 0000 0011 1001 1101 0000 1100 0110 1100 0010 1100 0110 1100 0000 1101

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

» More ops: Convert 1 017 101 610 150 887, 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