Convert -1 001 100 999 434 to a Signed Binary in One's (1's) Complement Representation

How to convert decimal number -1 001 100 999 434(10) to a signed binary in one's (1's) complement representation

What are the steps to convert decimal number
-1 001 100 999 434 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. Start with the positive version of the number:

|-1 001 100 999 434| = 1 001 100 999 434

2. 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 001 100 999 434 ÷ 2 = 500 550 499 717 + 0;
  • 500 550 499 717 ÷ 2 = 250 275 249 858 + 1;
  • 250 275 249 858 ÷ 2 = 125 137 624 929 + 0;
  • 125 137 624 929 ÷ 2 = 62 568 812 464 + 1;
  • 62 568 812 464 ÷ 2 = 31 284 406 232 + 0;
  • 31 284 406 232 ÷ 2 = 15 642 203 116 + 0;
  • 15 642 203 116 ÷ 2 = 7 821 101 558 + 0;
  • 7 821 101 558 ÷ 2 = 3 910 550 779 + 0;
  • 3 910 550 779 ÷ 2 = 1 955 275 389 + 1;
  • 1 955 275 389 ÷ 2 = 977 637 694 + 1;
  • 977 637 694 ÷ 2 = 488 818 847 + 0;
  • 488 818 847 ÷ 2 = 244 409 423 + 1;
  • 244 409 423 ÷ 2 = 122 204 711 + 1;
  • 122 204 711 ÷ 2 = 61 102 355 + 1;
  • 61 102 355 ÷ 2 = 30 551 177 + 1;
  • 30 551 177 ÷ 2 = 15 275 588 + 1;
  • 15 275 588 ÷ 2 = 7 637 794 + 0;
  • 7 637 794 ÷ 2 = 3 818 897 + 0;
  • 3 818 897 ÷ 2 = 1 909 448 + 1;
  • 1 909 448 ÷ 2 = 954 724 + 0;
  • 954 724 ÷ 2 = 477 362 + 0;
  • 477 362 ÷ 2 = 238 681 + 0;
  • 238 681 ÷ 2 = 119 340 + 1;
  • 119 340 ÷ 2 = 59 670 + 0;
  • 59 670 ÷ 2 = 29 835 + 0;
  • 29 835 ÷ 2 = 14 917 + 1;
  • 14 917 ÷ 2 = 7 458 + 1;
  • 7 458 ÷ 2 = 3 729 + 0;
  • 3 729 ÷ 2 = 1 864 + 1;
  • 1 864 ÷ 2 = 932 + 0;
  • 932 ÷ 2 = 466 + 0;
  • 466 ÷ 2 = 233 + 0;
  • 233 ÷ 2 = 116 + 1;
  • 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;

3. Construct the base 2 representation of the positive number:

Take all the remainders starting from the bottom of the list constructed above.

1 001 100 999 434(10) = 1110 1001 0001 0110 0100 0100 1111 1011 0000 1010(2)

4. 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.


5. 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 001 100 999 434(10) = 0000 0000 0000 0000 0000 0000 1110 1001 0001 0110 0100 0100 1111 1011 0000 1010

6. Get the negative integer number representation:

  • To write the negative integer number on 64 bits (8 Bytes), as a signed binary in one's complement representation,

  • ... Reverse all the bits from 0 to 1 and from 1 to 0 (flip the digits).


-1 001 100 999 434(10) = !(0000 0000 0000 0000 0000 0000 1110 1001 0001 0110 0100 0100 1111 1011 0000 1010)


Decimal Number -1 001 100 999 434(10) converted to signed binary in one's complement representation:

-1 001 100 999 434(10) = 1111 1111 1111 1111 1111 1111 0001 0110 1110 1001 1011 1011 0000 0100 1111 0101

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

Share

» More ops: Convert decimal -1 001 100 999 416 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 06, 2026 [June]: Decimal Numbers Converted to Signed Binary in One's (1's) Complement Representation. Calculations performed during the month of: June - by our visitors

» Improve your social skills: The Art of Strategic Ambiguity and Concealed Intentions. NotebookLM YouTube Video of 6.59 minutes

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