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

Signed binary two's complement 0000 0111 1111 1111 1111 1111 1100 0111(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.

0000 0111 1111 1111 1111 1111 1100 0111 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

      0

    • 229

      0

    • 228

      0

    • 227

      0

    • 226

      1

    • 225

      1

    • 224

      1

    • 223

      1

    • 222

      1

    • 221

      1

    • 220

      1

    • 219

      1

    • 218

      1

    • 217

      1

    • 216

      1

    • 215

      1

    • 214

      1

    • 213

      1

    • 212

      1

    • 211

      1

    • 210

      1

    • 29

      1

    • 28

      1

    • 27

      1

    • 26

      1

    • 25

      0

    • 24

      0

    • 23

      0

    • 22

      1

    • 21

      1

    • 20

      1

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

0000 0111 1111 1111 1111 1111 1100 0111(2) =

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

(0 + 0 + 0 + 0 + 0 + 67 108 864 + 33 554 432 + 16 777 216 + 8 388 608 + 4 194 304 + 2 097 152 + 1 048 576 + 524 288 + 262 144 + 131 072 + 65 536 + 32 768 + 16 384 + 8 192 + 4 096 + 2 048 + 1 024 + 512 + 256 + 128 + 64 + 0 + 0 + 0 + 4 + 2 + 1)(10) =

(67 108 864 + 33 554 432 + 16 777 216 + 8 388 608 + 4 194 304 + 2 097 152 + 1 048 576 + 524 288 + 262 144 + 131 072 + 65 536 + 32 768 + 16 384 + 8 192 + 4 096 + 2 048 + 1 024 + 512 + 256 + 128 + 64 + 4 + 2 + 1)(10) =

134 217 671(10)

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

0000 0111 1111 1111 1111 1111 1100 0111(2) = 134 217 671(10)

Number 0000 0111 1111 1111 1111 1111 1100 0111(2) converted from signed binary two's complement representation to an integer in decimal system (in base 10):
0000 0111 1111 1111 1111 1111 1100 0111(2) = 134 217 671(10)

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

More operations of this kind:

0000 0111 1111 1111 1111 1111 1100 0110 = ?

0000 0111 1111 1111 1111 1111 1100 1000 = ?


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)

0000 0111 1111 1111 1111 1111 1100 0111 = 134,217,671 Mar 24 08:47 UTC (GMT)
1100 0000 1100 0011 1111 1111 1111 1001 = -1,060,896,775 Mar 24 08:47 UTC (GMT)
1111 1111 1111 1111 1111 1000 1001 1101 = -1,891 Mar 24 08:47 UTC (GMT)
1111 0001 = -15 Mar 24 08:47 UTC (GMT)
0101 1000 0000 1011 = 22,539 Mar 24 08:47 UTC (GMT)
1111 0010 0001 0110 = -3,562 Mar 24 08:45 UTC (GMT)
1000 0001 = -127 Mar 24 08:44 UTC (GMT)
1011 1001 0101 0000 0000 0000 0000 1011 = -1,185,939,445 Mar 24 08:42 UTC (GMT)
0010 1111 0100 1111 1111 1111 1111 1101 = 793,772,029 Mar 24 08:40 UTC (GMT)
1111 0110 0000 1001 = -2,551 Mar 24 08:40 UTC (GMT)
0010 1001 1111 1010 = 10,746 Mar 24 08:39 UTC (GMT)
1111 1111 1111 1111 1111 1110 0000 1000 = -504 Mar 24 08:39 UTC (GMT)
1111 1101 = -3 Mar 24 08:38 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