Signed binary two's complement number 0110 0100 1100 0111 0111 1111 1111 1111 converted to decimal system (base ten) signed integer

Signed binary two's complement 0110 0100 1100 0111 0111 1111 1111 1111(2) to an integer in decimal system (in base 10) = ?

1. Is this a positive or a negative number?

In a signed binary two's complement,

The first bit (the leftmost) indicates the sign,

1 = negative, 0 = positive.

0110 0100 1100 0111 0111 1111 1111 1111 is the binary representation of a positive integer, on 32 bits (4 Bytes).


2. Get the binary representation in one's complement:

* Run this step only if the number is negative *

Note: 11 - 1 = 10; 10 - 1 = 1; 1 - 0 = 1; 1 - 1 = 0.

Subtract 1 from the initial binary number.

* Not the case - the number is positive *


3. Get the binary representation of the positive (unsigned) number:

* Run this step only if the number is negative *

Flip all the bits in the signed binary one's complement representation (reverse the digits) - replace the bits set on 1 with 0s and the bits on 0 with 1s:

* Not the case - the number is positive *


4. Map the unsigned binary number's digits versus the corresponding powers of 2 that their place value represent:

    • 231

      0

    • 230

      1

    • 229

      1

    • 228

      0

    • 227

      0

    • 226

      1

    • 225

      0

    • 224

      0

    • 223

      1

    • 222

      1

    • 221

      0

    • 220

      0

    • 219

      0

    • 218

      1

    • 217

      1

    • 216

      1

    • 215

      0

    • 214

      1

    • 213

      1

    • 212

      1

    • 211

      1

    • 210

      1

    • 29

      1

    • 28

      1

    • 27

      1

    • 26

      1

    • 25

      1

    • 24

      1

    • 23

      1

    • 22

      1

    • 21

      1

    • 20

      1

5. Multiply each bit by its corresponding power of 2 and add all the terms up:

0110 0100 1100 0111 0111 1111 1111 1111(2) =

(0 × 231 + 1 × 230 + 1 × 229 + 0 × 228 + 0 × 227 + 1 × 226 + 0 × 225 + 0 × 224 + 1 × 223 + 1 × 222 + 0 × 221 + 0 × 220 + 0 × 219 + 1 × 218 + 1 × 217 + 1 × 216 + 0 × 215 + 1 × 214 + 1 × 213 + 1 × 212 + 1 × 211 + 1 × 210 + 1 × 29 + 1 × 28 + 1 × 27 + 1 × 26 + 1 × 25 + 1 × 24 + 1 × 23 + 1 × 22 + 1 × 21 + 1 × 20)(10) =

(0 + 1 073 741 824 + 536 870 912 + 0 + 0 + 67 108 864 + 0 + 0 + 8 388 608 + 4 194 304 + 0 + 0 + 0 + 262 144 + 131 072 + 65 536 + 0 + 16 384 + 8 192 + 4 096 + 2 048 + 1 024 + 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1)(10) =

(1 073 741 824 + 536 870 912 + 67 108 864 + 8 388 608 + 4 194 304 + 262 144 + 131 072 + 65 536 + 16 384 + 8 192 + 4 096 + 2 048 + 1 024 + 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1)(10) =

1 690 796 031(10)

6. If needed, adjust the sign of the integer number by the first digit (leftmost) of the signed binary:

0110 0100 1100 0111 0111 1111 1111 1111(2) = 1 690 796 031(10)

Number 0110 0100 1100 0111 0111 1111 1111 1111(2) converted from signed binary two's complement representation to an integer in decimal system (in base 10):
0110 0100 1100 0111 0111 1111 1111 1111(2) = 1 690 796 031(10)

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

More operations of this kind:

0110 0100 1100 0111 0111 1111 1111 1110 converted from: signed binary two's complement representation, to signed integer = ?

0110 0100 1100 0111 1000 0000 0000 0000 converted from: signed binary two's complement representation, to signed integer = ?


Convert signed binary two's complement numbers to decimal system (base ten) integers

Entered binary number length must be: 2, 4, 8, 16, 32, or 64 - otherwise extra bits on 0 will be added in front (to the left).

How to convert a signed binary number in two's complement representation to an integer in base ten:

1) In a signed binary two's complement, first bit (leftmost) indicates the sign, 1 = negative, 0 = positive.

2) Get the signed binary representation in one's complement, subtract 1 from the initial number.

3) Construct the unsigned binary number: flip all the bits in the signed binary one's complement representation (reversing the digits) - replace the bits set on 1 with 0s and the bits on 0 with 1s.

4) Multiply each bit of the binary number by its corresponding power of 2 that its place value represents.

5) Add all the terms up to get the positive integer number in base ten.

6) Adjust the sign of the integer number by the first bit of the initial binary number.

Latest binary numbers in two's complement representation converted to signed integers in decimal system (base ten)

0110 0100 1100 0111 0111 1111 1111 1111 converted from: signed binary two's complement representation, to signed integer = 1,690,796,031 May 29 14:32 UTC (GMT)
1100 1100 1100 1100 1100 1100 1101 1110 converted from: signed binary two's complement representation, to signed integer = -858,993,442 May 29 14:32 UTC (GMT)
1101 1110 0010 1000 converted from: signed binary two's complement representation, to signed integer = -8,664 May 29 14:32 UTC (GMT)
0000 0001 1001 1000 converted from: signed binary two's complement representation, to signed integer = 408 May 29 14:31 UTC (GMT)
1001 0010 1001 0000 converted from: signed binary two's complement representation, to signed integer = -28,016 May 29 14:31 UTC (GMT)
1000 0000 0000 0000 0000 0011 1110 0001 converted from: signed binary two's complement representation, to signed integer = -2,147,482,655 May 29 14:30 UTC (GMT)
0111 0000 0101 0100 converted from: signed binary two's complement representation, to signed integer = 28,756 May 29 14:29 UTC (GMT)
0101 0101 converted from: signed binary two's complement representation, to signed integer = 85 May 29 14:29 UTC (GMT)
0000 0000 0000 0000 0000 0000 0000 0001 1111 1111 1111 1111 1111 1111 1110 0001 converted from: signed binary two's complement representation, to signed integer = 8,589,934,561 May 29 14:29 UTC (GMT)
1000 1000 1100 1010 0110 1100 0001 1101 converted from: signed binary two's complement representation, to signed integer = -1,999,999,971 May 29 14:29 UTC (GMT)
0000 0000 0000 0000 0100 1001 1111 1111 converted from: signed binary two's complement representation, to signed integer = 18,943 May 29 14:29 UTC (GMT)
1011 1110 0101 0011 1001 1001 1111 1010 converted from: signed binary two's complement representation, to signed integer = -1,101,817,350 May 29 14:29 UTC (GMT)
1011 1110 1010 1111 1111 1111 1111 1110 converted from: signed binary two's complement representation, to signed integer = -1,095,761,922 May 29 14:29 UTC (GMT)
All the converted signed binary two's complement numbers

How to convert signed binary numbers in two's complement representation from binary system to decimal

To understand how to convert a signed binary number in two's complement representation from the binary system to decimal (base ten), the easiest way is to do it by an example - convert binary, 1101 1110, to base ten:

  • In a signed binary two's complement, first bit (leftmost) indicates the sign, 1 = negative, 0 = positive. The first bit is 1, so our number is negative.
  • Get the signed binary representation in one's complement, subtract 1 from the initial number:
    1101 1110 - 1 = 1101 1101
  • Get the binary representation of the positive number, flip all the bits in the signed binary one's complement representation (reversing the digits) - replace the bits set on 1 with 0s and the bits on 0 with 1s:
    !(1101 1101) = 0010 0010
  • Write bellow the positive binary number representation in base two, and above each bit that makes up the binary number write the corresponding power of 2 (numeral base) that its place value represents, starting with zero, from the right of the number (rightmost bit), walking to the left of the number, increasing each corresonding power of 2 by exactly one unit:
  • powers of 2: 7 6 5 4 3 2 1 0
    digits: 0 0 1 0 0 0 1 0
  • Build the representation of the positive number in base 10, by taking each digit of the binary number, multiplying it by the corresponding power of 2 and then adding all the terms up:

    0010 0010(2) =

    (0 × 27 + 0 × 26 + 1 × 25 + 0 × 24 + 0 × 23 + 0 × 22 + 1 × 21 + 0 × 20)(10) =

    (0 + 0 + 32 + 0 + 0 + 0 + 2 + 0)(10) =

    (32 + 2)(10) =

    34(10)

  • Signed binary number in two's complement representation, 1101 1110 = -34(10), a signed negative integer in base 10