Convert -3 414 649 360 to a signed binary in one's complement representation, from a base 10 decimal system signed integer number

-3 414 649 360(10) to a signed binary one's complement representation = ?

1. Start with the positive version of the number:

|-3 414 649 360| = 3 414 649 360

2. Divide the number repeatedly by 2:

Keep track of each remainder.

We stop when we get a quotient that is equal to zero.

  • division = quotient + remainder;
  • 3 414 649 360 ÷ 2 = 1 707 324 680 + 0;
  • 1 707 324 680 ÷ 2 = 853 662 340 + 0;
  • 853 662 340 ÷ 2 = 426 831 170 + 0;
  • 426 831 170 ÷ 2 = 213 415 585 + 0;
  • 213 415 585 ÷ 2 = 106 707 792 + 1;
  • 106 707 792 ÷ 2 = 53 353 896 + 0;
  • 53 353 896 ÷ 2 = 26 676 948 + 0;
  • 26 676 948 ÷ 2 = 13 338 474 + 0;
  • 13 338 474 ÷ 2 = 6 669 237 + 0;
  • 6 669 237 ÷ 2 = 3 334 618 + 1;
  • 3 334 618 ÷ 2 = 1 667 309 + 0;
  • 1 667 309 ÷ 2 = 833 654 + 1;
  • 833 654 ÷ 2 = 416 827 + 0;
  • 416 827 ÷ 2 = 208 413 + 1;
  • 208 413 ÷ 2 = 104 206 + 1;
  • 104 206 ÷ 2 = 52 103 + 0;
  • 52 103 ÷ 2 = 26 051 + 1;
  • 26 051 ÷ 2 = 13 025 + 1;
  • 13 025 ÷ 2 = 6 512 + 1;
  • 6 512 ÷ 2 = 3 256 + 0;
  • 3 256 ÷ 2 = 1 628 + 0;
  • 1 628 ÷ 2 = 814 + 0;
  • 814 ÷ 2 = 407 + 0;
  • 407 ÷ 2 = 203 + 1;
  • 203 ÷ 2 = 101 + 1;
  • 101 ÷ 2 = 50 + 1;
  • 50 ÷ 2 = 25 + 0;
  • 25 ÷ 2 = 12 + 1;
  • 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:

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

3 414 649 360(10) = 1100 1011 1000 0111 0110 1010 0001 0000(2)


4. Determine the signed binary number bit length:

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

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

First bit (the leftmost) indicates the sign,
1 = negative, 0 = positive.

The least number that is:


a power of 2


and is larger than the actual length, 32,


so that the first bit (leftmost) could be zero


(we deal with a positive number at this moment)


is: 64.


5. 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:

3 414 649 360(10) = 0000 0000 0000 0000 0000 0000 0000 0000 1100 1011 1000 0111 0110 1010 0001 0000


6. Get the negative integer number representation:

To get the negative integer number representation on 64 bits (8 Bytes),


signed binary one's complement,


replace all the bits on 0 with 1s


and all the bits set on 1 with 0s


(reverse the digits, flip the digits)


!(0000 0000 0000 0000 0000 0000 0000 0000 1100 1011 1000 0111 0110 1010 0001 0000) =


1111 1111 1111 1111 1111 1111 1111 1111 0011 0100 0111 1000 1001 0101 1110 1111


Number -3 414 649 360, a signed integer, converted from decimal system (base 10) to a signed binary one's complement representation:

-3 414 649 360(10) = 1111 1111 1111 1111 1111 1111 1111 1111 0011 0100 0111 1000 1001 0101 1110 1111

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


More operations of this kind:

-3 414 649 361 = ? | -3 414 649 359 = ?


Convert signed integer numbers from the decimal system (base ten) to signed binary one's complement representation

How to convert a base 10 signed integer number to signed binary in one's complement representation:

1) Divide the positive version of number repeatedly by 2, keeping track of each remainder, till getting a quotient that is 0.

2) Construct the base 2 representation by taking the previously calculated remainders starting from the last remainder up to the first one, in that order.

3) Construct the positive binary computer representation so that the first bit is 0.

4) Only if the initial number is negative, switch all the bits from 0 to 1 and from 1 to 0 (reversing the digits).

Latest signed integer numbers converted from decimal system to signed binary in one's complement representation

-3,414,649,360 to signed binary one's complement = ? Apr 18 08:58 UTC (GMT)
171 to signed binary one's complement = ? Apr 18 08:57 UTC (GMT)
147 to signed binary one's complement = ? Apr 18 08:57 UTC (GMT)
3,037 to signed binary one's complement = ? Apr 18 08:56 UTC (GMT)
27 to signed binary one's complement = ? Apr 18 08:56 UTC (GMT)
425 to signed binary one's complement = ? Apr 18 08:56 UTC (GMT)
-199 to signed binary one's complement = ? Apr 18 08:56 UTC (GMT)
-32,561 to signed binary one's complement = ? Apr 18 08:56 UTC (GMT)
36 to signed binary one's complement = ? Apr 18 08:56 UTC (GMT)
7,735 to signed binary one's complement = ? Apr 18 08:56 UTC (GMT)
110 to signed binary one's complement = ? Apr 18 08:56 UTC (GMT)
-1,076 to signed binary one's complement = ? Apr 18 08:55 UTC (GMT)
-37,315,560 to signed binary one's complement = ? Apr 18 08:55 UTC (GMT)
All decimal integer numbers converted to signed binary one's complement representation

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