Convert 1 207 889 999 837 to a Signed Binary (Base 2)

How to convert 1 207 889 999 837(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 207 889 999 837 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 207 889 999 837 ÷ 2 = 603 944 999 918 + 1;
  • 603 944 999 918 ÷ 2 = 301 972 499 959 + 0;
  • 301 972 499 959 ÷ 2 = 150 986 249 979 + 1;
  • 150 986 249 979 ÷ 2 = 75 493 124 989 + 1;
  • 75 493 124 989 ÷ 2 = 37 746 562 494 + 1;
  • 37 746 562 494 ÷ 2 = 18 873 281 247 + 0;
  • 18 873 281 247 ÷ 2 = 9 436 640 623 + 1;
  • 9 436 640 623 ÷ 2 = 4 718 320 311 + 1;
  • 4 718 320 311 ÷ 2 = 2 359 160 155 + 1;
  • 2 359 160 155 ÷ 2 = 1 179 580 077 + 1;
  • 1 179 580 077 ÷ 2 = 589 790 038 + 1;
  • 589 790 038 ÷ 2 = 294 895 019 + 0;
  • 294 895 019 ÷ 2 = 147 447 509 + 1;
  • 147 447 509 ÷ 2 = 73 723 754 + 1;
  • 73 723 754 ÷ 2 = 36 861 877 + 0;
  • 36 861 877 ÷ 2 = 18 430 938 + 1;
  • 18 430 938 ÷ 2 = 9 215 469 + 0;
  • 9 215 469 ÷ 2 = 4 607 734 + 1;
  • 4 607 734 ÷ 2 = 2 303 867 + 0;
  • 2 303 867 ÷ 2 = 1 151 933 + 1;
  • 1 151 933 ÷ 2 = 575 966 + 1;
  • 575 966 ÷ 2 = 287 983 + 0;
  • 287 983 ÷ 2 = 143 991 + 1;
  • 143 991 ÷ 2 = 71 995 + 1;
  • 71 995 ÷ 2 = 35 997 + 1;
  • 35 997 ÷ 2 = 17 998 + 1;
  • 17 998 ÷ 2 = 8 999 + 0;
  • 8 999 ÷ 2 = 4 499 + 1;
  • 4 499 ÷ 2 = 2 249 + 1;
  • 2 249 ÷ 2 = 1 124 + 1;
  • 1 124 ÷ 2 = 562 + 0;
  • 562 ÷ 2 = 281 + 0;
  • 281 ÷ 2 = 140 + 1;
  • 140 ÷ 2 = 70 + 0;
  • 70 ÷ 2 = 35 + 0;
  • 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.

1 207 889 999 837(10) = 1 0001 1001 0011 1011 1101 1010 1011 0111 1101 1101(2)


3. Determine the signed binary number bit length:

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

  • 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, 41,

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 207 889 999 837(10) Base 10 integer number converted and written as a signed binary code (in base 2):

1 207 889 999 837(10) = 0000 0000 0000 0000 0000 0001 0001 1001 0011 1011 1101 1010 1011 0111 1101 1101

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

Share

» More ops: Convert 1 207 889 999 820, 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 09, 2026 [September]: Signed base 10 integer numbers converted and written as signed binary code. Calculations performed during the month of: September - by our visitors

» Improve your social skills: My Manager Only Says “We” When Referring to “My Work”. Gemini Notebook YouTube Video of 11.13 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