Convert 1 038 264 240 274 to a Signed Binary in One's (1's) Complement Representation

How to convert decimal number 1 038 264 240 274(10) to a signed binary in one's (1's) complement representation

What are the steps to convert decimal number
1 038 264 240 274 to a signed binary in one's (1's) complement representation?

  • 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 038 264 240 274 ÷ 2 = 519 132 120 137 + 0;
  • 519 132 120 137 ÷ 2 = 259 566 060 068 + 1;
  • 259 566 060 068 ÷ 2 = 129 783 030 034 + 0;
  • 129 783 030 034 ÷ 2 = 64 891 515 017 + 0;
  • 64 891 515 017 ÷ 2 = 32 445 757 508 + 1;
  • 32 445 757 508 ÷ 2 = 16 222 878 754 + 0;
  • 16 222 878 754 ÷ 2 = 8 111 439 377 + 0;
  • 8 111 439 377 ÷ 2 = 4 055 719 688 + 1;
  • 4 055 719 688 ÷ 2 = 2 027 859 844 + 0;
  • 2 027 859 844 ÷ 2 = 1 013 929 922 + 0;
  • 1 013 929 922 ÷ 2 = 506 964 961 + 0;
  • 506 964 961 ÷ 2 = 253 482 480 + 1;
  • 253 482 480 ÷ 2 = 126 741 240 + 0;
  • 126 741 240 ÷ 2 = 63 370 620 + 0;
  • 63 370 620 ÷ 2 = 31 685 310 + 0;
  • 31 685 310 ÷ 2 = 15 842 655 + 0;
  • 15 842 655 ÷ 2 = 7 921 327 + 1;
  • 7 921 327 ÷ 2 = 3 960 663 + 1;
  • 3 960 663 ÷ 2 = 1 980 331 + 1;
  • 1 980 331 ÷ 2 = 990 165 + 1;
  • 990 165 ÷ 2 = 495 082 + 1;
  • 495 082 ÷ 2 = 247 541 + 0;
  • 247 541 ÷ 2 = 123 770 + 1;
  • 123 770 ÷ 2 = 61 885 + 0;
  • 61 885 ÷ 2 = 30 942 + 1;
  • 30 942 ÷ 2 = 15 471 + 0;
  • 15 471 ÷ 2 = 7 735 + 1;
  • 7 735 ÷ 2 = 3 867 + 1;
  • 3 867 ÷ 2 = 1 933 + 1;
  • 1 933 ÷ 2 = 966 + 1;
  • 966 ÷ 2 = 483 + 0;
  • 483 ÷ 2 = 241 + 1;
  • 241 ÷ 2 = 120 + 1;
  • 120 ÷ 2 = 60 + 0;
  • 60 ÷ 2 = 30 + 0;
  • 30 ÷ 2 = 15 + 0;
  • 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.

1 038 264 240 274(10) = 1111 0001 1011 1101 0101 1111 0000 1000 1001 0010(2)

3. Determine the signed binary number bit length:

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

  • 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) indicates 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, 40,

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.


Decimal Number 1 038 264 240 274(10) converted to signed binary in one's complement representation:

1 038 264 240 274(10) = 0000 0000 0000 0000 0000 0000 1111 0001 1011 1101 0101 1111 0000 1000 1001 0010

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

» More ops: Convert decimal 1 038 264 240 297 to signed binary in one's (1's) complement representation

» Calculations Performed by Our Visitors: Decimal Numbers Converted to Signed Binary in One's (1's) Complement Representation. Data organized on a Monthly Basis

» Month 10, 2026 [October]: Decimal Numbers Converted to Signed Binary in One's (1's) Complement Representation. Calculations performed during the month of: October - by our visitors

How to convert signed integers from the decimal system to signed binary in one's complement representation

Follow the steps below to convert a signed base 10 integer number to signed binary in one's complement representation:

  • 1. If the number to be converted is negative, start with the positive version of the number.
  • 2. Divide repeatedly by 2 the positive representation of the integer number that is to be converted to binary, keeping track of each remainder, until we get a quotient that is equal to 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 must have 4, 8, 16, 32, 64, ... bit length (a power of 2) - if needed, fill in '0' bits in front (to the left) of the base 2 number calculated above, up to the right length; this way the first bit (leftmost) will always be '0', correctly representing a positive number.
  • 5. To get the negative integer number representation in signed binary one's complement, replace all '0' bits with '1's and all '1' bits with '0's.

Example: convert the negative number -49 from the decimal system (base ten) to signed binary one's complement:

  • 1. Start with the positive version of the number: |-49| = 49
  • 2. Divide repeatedly 49 by 2, keeping track of each remainder:
    • division = quotient + remainder
    • 49 ÷ 2 = 24 + 1
    • 24 ÷ 2 = 12 + 0
    • 12 ÷ 2 = 6 + 0
    • 6 ÷ 2 = 3 + 0
    • 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:
    49(10) = 11 0001(2)
  • 4. The actual bit length of base 2 representation is 6, so the positive binary computer representation of a signed binary will take in this case 8 bits (the least power of 2 that is larger than 6) - add '0's in front of the base 2 number, up to the required length:
    49(10) = 0011 0001(2)
  • 5. To get the negative integer number representation in signed binary one's complement, replace all '0' bits with '1's and all '1' bits with '0's:
    -49(10) = 1100 1110
  • Number -49(10), signed integer, converted from the decimal system (base 10) to signed binary in one's complement representation = 1100 1110