Convert 7 995 721 801 990 to a Signed Binary (Base 2)

How to convert 7 995 721 801 990(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 7 995 721 801 990 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;
  • 7 995 721 801 990 ÷ 2 = 3 997 860 900 995 + 0;
  • 3 997 860 900 995 ÷ 2 = 1 998 930 450 497 + 1;
  • 1 998 930 450 497 ÷ 2 = 999 465 225 248 + 1;
  • 999 465 225 248 ÷ 2 = 499 732 612 624 + 0;
  • 499 732 612 624 ÷ 2 = 249 866 306 312 + 0;
  • 249 866 306 312 ÷ 2 = 124 933 153 156 + 0;
  • 124 933 153 156 ÷ 2 = 62 466 576 578 + 0;
  • 62 466 576 578 ÷ 2 = 31 233 288 289 + 0;
  • 31 233 288 289 ÷ 2 = 15 616 644 144 + 1;
  • 15 616 644 144 ÷ 2 = 7 808 322 072 + 0;
  • 7 808 322 072 ÷ 2 = 3 904 161 036 + 0;
  • 3 904 161 036 ÷ 2 = 1 952 080 518 + 0;
  • 1 952 080 518 ÷ 2 = 976 040 259 + 0;
  • 976 040 259 ÷ 2 = 488 020 129 + 1;
  • 488 020 129 ÷ 2 = 244 010 064 + 1;
  • 244 010 064 ÷ 2 = 122 005 032 + 0;
  • 122 005 032 ÷ 2 = 61 002 516 + 0;
  • 61 002 516 ÷ 2 = 30 501 258 + 0;
  • 30 501 258 ÷ 2 = 15 250 629 + 0;
  • 15 250 629 ÷ 2 = 7 625 314 + 1;
  • 7 625 314 ÷ 2 = 3 812 657 + 0;
  • 3 812 657 ÷ 2 = 1 906 328 + 1;
  • 1 906 328 ÷ 2 = 953 164 + 0;
  • 953 164 ÷ 2 = 476 582 + 0;
  • 476 582 ÷ 2 = 238 291 + 0;
  • 238 291 ÷ 2 = 119 145 + 1;
  • 119 145 ÷ 2 = 59 572 + 1;
  • 59 572 ÷ 2 = 29 786 + 0;
  • 29 786 ÷ 2 = 14 893 + 0;
  • 14 893 ÷ 2 = 7 446 + 1;
  • 7 446 ÷ 2 = 3 723 + 0;
  • 3 723 ÷ 2 = 1 861 + 1;
  • 1 861 ÷ 2 = 930 + 1;
  • 930 ÷ 2 = 465 + 0;
  • 465 ÷ 2 = 232 + 1;
  • 232 ÷ 2 = 116 + 0;
  • 116 ÷ 2 = 58 + 0;
  • 58 ÷ 2 = 29 + 0;
  • 29 ÷ 2 = 14 + 1;
  • 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.

7 995 721 801 990(10) = 111 0100 0101 1010 0110 0010 1000 0110 0001 0000 0110(2)


3. Determine the signed binary number bit length:

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

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

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:


7 995 721 801 990(10) Base 10 integer number converted and written as a signed binary code (in base 2):

7 995 721 801 990(10) = 0000 0000 0000 0000 0000 0111 0100 0101 1010 0110 0010 1000 0110 0001 0000 0110

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

Share

» More ops: Convert 7 995 721 801 971, 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: The Attention Economy - The Battlefield For Your Focus. NotebookLM YouTube Video of 7.50 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