Signed binary two's complement number 0000 0000 1000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0001 0000 converted to decimal system (base ten) signed integer

Signed binary two's complement 0000 0000 1000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0001 0000(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 0000 1000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0001 0000 is the binary representation of a positive integer, on 64 bits (8 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:

    • 263

      0
    • 262

      0
    • 261

      0
    • 260

      0
    • 259

      0
    • 258

      0
    • 257

      0
    • 256

      0
    • 255

      1
    • 254

      0
    • 253

      0
    • 252

      0
    • 251

      0
    • 250

      0
    • 249

      0
    • 248

      0
    • 247

      0
    • 246

      0
    • 245

      0
    • 244

      0
    • 243

      0
    • 242

      0
    • 241

      0
    • 240

      0
    • 239

      0
    • 238

      0
    • 237

      0
    • 236

      0
    • 235

      0
    • 234

      0
    • 233

      0
    • 232

      0
    • 231

      0
    • 230

      0
    • 229

      0
    • 228

      0
    • 227

      0
    • 226

      0
    • 225

      0
    • 224

      0
    • 223

      0
    • 222

      0
    • 221

      0
    • 220

      0
    • 219

      0
    • 218

      0
    • 217

      0
    • 216

      0
    • 215

      0
    • 214

      0
    • 213

      0
    • 212

      0
    • 211

      0
    • 210

      0
    • 29

      0
    • 28

      0
    • 27

      0
    • 26

      0
    • 25

      0
    • 24

      1
    • 23

      0
    • 22

      0
    • 21

      0
    • 20

      0

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

0000 0000 1000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0001 0000(2) =


(0 × 263 + 0 × 262 + 0 × 261 + 0 × 260 + 0 × 259 + 0 × 258 + 0 × 257 + 0 × 256 + 1 × 255 + 0 × 254 + 0 × 253 + 0 × 252 + 0 × 251 + 0 × 250 + 0 × 249 + 0 × 248 + 0 × 247 + 0 × 246 + 0 × 245 + 0 × 244 + 0 × 243 + 0 × 242 + 0 × 241 + 0 × 240 + 0 × 239 + 0 × 238 + 0 × 237 + 0 × 236 + 0 × 235 + 0 × 234 + 0 × 233 + 0 × 232 + 0 × 231 + 0 × 230 + 0 × 229 + 0 × 228 + 0 × 227 + 0 × 226 + 0 × 225 + 0 × 224 + 0 × 223 + 0 × 222 + 0 × 221 + 0 × 220 + 0 × 219 + 0 × 218 + 0 × 217 + 0 × 216 + 0 × 215 + 0 × 214 + 0 × 213 + 0 × 212 + 0 × 211 + 0 × 210 + 0 × 29 + 0 × 28 + 0 × 27 + 0 × 26 + 0 × 25 + 1 × 24 + 0 × 23 + 0 × 22 + 0 × 21 + 0 × 20)(10) =


(0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 36 028 797 018 963 968 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 16 + 0 + 0 + 0 + 0)(10) =


(36 028 797 018 963 968 + 16)(10) =


36 028 797 018 963 984(10)

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

0000 0000 1000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0001 0000(2) = 36 028 797 018 963 984(10)

Number 0000 0000 1000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0001 0000(2) converted from signed binary two's complement representation to an integer in decimal system (in base 10):
0000 0000 1000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0001 0000(2) = 36 028 797 018 963 984(10)

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


More operations of this kind:

0000 0000 1000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 1111 converted from: signed binary two's complement representation, to signed integer = ?

0000 0000 1000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0001 0001 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)

0000 0000 1000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0001 0000 converted from: signed binary two's complement representation, to signed integer = 36,028,797,018,963,984 May 29 15:31 UTC (GMT)
0000 0000 0000 0000 0000 0111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1001 converted from: signed binary two's complement representation, to signed integer = 8,796,093,022,201 May 29 15:30 UTC (GMT)
1001 1001 1110 1100 converted from: signed binary two's complement representation, to signed integer = -26,132 May 29 15:27 UTC (GMT)
1010 1000 0000 0001 1000 0110 1010 0000 converted from: signed binary two's complement representation, to signed integer = -1,476,295,008 May 29 15:24 UTC (GMT)
0000 0000 0001 1111 1111 1101 1111 0100 converted from: signed binary two's complement representation, to signed integer = 2,096,628 May 29 15:24 UTC (GMT)
0100 0101 0010 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 0111 converted from: signed binary two's complement representation, to signed integer = 4,985,484,787,499,139,063 May 29 15:23 UTC (GMT)
1101 0000 0001 0001 converted from: signed binary two's complement representation, to signed integer = -12,271 May 29 15:22 UTC (GMT)
0111 0110 0011 0010 converted from: signed binary two's complement representation, to signed integer = 30,258 May 29 15:22 UTC (GMT)
1010 1111 1111 1111 1111 1111 1101 1100 converted from: signed binary two's complement representation, to signed integer = -1,342,177,316 May 29 15:22 UTC (GMT)
1111 0000 converted from: signed binary two's complement representation, to signed integer = -16 May 29 15:21 UTC (GMT)
0011 0110 converted from: signed binary two's complement representation, to signed integer = 54 May 29 15:18 UTC (GMT)
1010 0001 0011 0011 converted from: signed binary two's complement representation, to signed integer = -24,269 May 29 15:18 UTC (GMT)
0001 1010 1100 1000 converted from: signed binary two's complement representation, to signed integer = 6,856 May 29 15:17 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