Convert 68 844 433 778 229 to a Signed Binary (Base 2)

How to convert 68 844 433 778 229(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 68 844 433 778 229 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;
  • 68 844 433 778 229 ÷ 2 = 34 422 216 889 114 + 1;
  • 34 422 216 889 114 ÷ 2 = 17 211 108 444 557 + 0;
  • 17 211 108 444 557 ÷ 2 = 8 605 554 222 278 + 1;
  • 8 605 554 222 278 ÷ 2 = 4 302 777 111 139 + 0;
  • 4 302 777 111 139 ÷ 2 = 2 151 388 555 569 + 1;
  • 2 151 388 555 569 ÷ 2 = 1 075 694 277 784 + 1;
  • 1 075 694 277 784 ÷ 2 = 537 847 138 892 + 0;
  • 537 847 138 892 ÷ 2 = 268 923 569 446 + 0;
  • 268 923 569 446 ÷ 2 = 134 461 784 723 + 0;
  • 134 461 784 723 ÷ 2 = 67 230 892 361 + 1;
  • 67 230 892 361 ÷ 2 = 33 615 446 180 + 1;
  • 33 615 446 180 ÷ 2 = 16 807 723 090 + 0;
  • 16 807 723 090 ÷ 2 = 8 403 861 545 + 0;
  • 8 403 861 545 ÷ 2 = 4 201 930 772 + 1;
  • 4 201 930 772 ÷ 2 = 2 100 965 386 + 0;
  • 2 100 965 386 ÷ 2 = 1 050 482 693 + 0;
  • 1 050 482 693 ÷ 2 = 525 241 346 + 1;
  • 525 241 346 ÷ 2 = 262 620 673 + 0;
  • 262 620 673 ÷ 2 = 131 310 336 + 1;
  • 131 310 336 ÷ 2 = 65 655 168 + 0;
  • 65 655 168 ÷ 2 = 32 827 584 + 0;
  • 32 827 584 ÷ 2 = 16 413 792 + 0;
  • 16 413 792 ÷ 2 = 8 206 896 + 0;
  • 8 206 896 ÷ 2 = 4 103 448 + 0;
  • 4 103 448 ÷ 2 = 2 051 724 + 0;
  • 2 051 724 ÷ 2 = 1 025 862 + 0;
  • 1 025 862 ÷ 2 = 512 931 + 0;
  • 512 931 ÷ 2 = 256 465 + 1;
  • 256 465 ÷ 2 = 128 232 + 1;
  • 128 232 ÷ 2 = 64 116 + 0;
  • 64 116 ÷ 2 = 32 058 + 0;
  • 32 058 ÷ 2 = 16 029 + 0;
  • 16 029 ÷ 2 = 8 014 + 1;
  • 8 014 ÷ 2 = 4 007 + 0;
  • 4 007 ÷ 2 = 2 003 + 1;
  • 2 003 ÷ 2 = 1 001 + 1;
  • 1 001 ÷ 2 = 500 + 1;
  • 500 ÷ 2 = 250 + 0;
  • 250 ÷ 2 = 125 + 0;
  • 125 ÷ 2 = 62 + 1;
  • 62 ÷ 2 = 31 + 0;
  • 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.

68 844 433 778 229(10) = 11 1110 1001 1101 0001 1000 0000 0101 0010 0110 0011 0101(2)


3. Determine the signed binary number bit length:

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

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

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:


68 844 433 778 229(10) Base 10 integer number converted and written as a signed binary code (in base 2):

68 844 433 778 229(10) = 0000 0000 0000 0000 0011 1110 1001 1101 0001 1000 0000 0101 0010 0110 0011 0101

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

Share

» More ops: Convert 68 844 433 778 203, 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