In a signed binary, the first bit (the leftmost) is reserved for the sign,
1 = negative, 0 = positive. This bit does not count when calculating the absolute value.
2. Construct the unsigned binary number.
Exclude the first bit (the leftmost), that is reserved for the sign:
1100 0010 1101 0011 1111 1111 1110 0100 = 100 0010 1101 0011 1111 1111 1110 0100
3. Map the unsigned binary number's digits versus the corresponding powers of 2 that their place value represent:
230
1 229
0 228
0 227
0 226
0 225
1 224
0 223
1 222
1 221
0 220
1 219
0 218
0 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
1 24
0 23
0 22
1 21
0 20
0
4. Multiply each bit by its corresponding power of 2 and add all the terms up.
100 0010 1101 0011 1111 1111 1110 0100(2) =
(1 × 230 + 0 × 229 + 0 × 228 + 0 × 227 + 0 × 226 + 1 × 225 + 0 × 224 + 1 × 223 + 1 × 222 + 0 × 221 + 1 × 220 + 0 × 219 + 0 × 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 + 1 × 22 + 0 × 21 + 0 × 20)(10) =
(1 073 741 824 + 0 + 0 + 0 + 0 + 33 554 432 + 0 + 8 388 608 + 4 194 304 + 0 + 1 048 576 + 0 + 0 + 131 072 + 65 536 + 32 768 + 16 384 + 8 192 + 4 096 + 2 048 + 1 024 + 512 + 256 + 128 + 64 + 32 + 0 + 0 + 4 + 0 + 0)(10) =
(1 073 741 824 + 33 554 432 + 8 388 608 + 4 194 304 + 1 048 576 + 131 072 + 65 536 + 32 768 + 16 384 + 8 192 + 4 096 + 2 048 + 1 024 + 512 + 256 + 128 + 64 + 32 + 4)(10) =
1 121 189 860(10)
5. If needed, adjust the sign of the integer number by the first digit (leftmost) of the signed binary:
1100 0010 1101 0011 1111 1111 1110 0100(2) = -1 121 189 860(10)
The number 1100 0010 1101 0011 1111 1111 1110 0100(2) converted from a signed binary (base two) and written as an integer in decimal system (base ten):
1100 0010 1101 0011 1111 1111 1110 0100(2) = -1 121 189 860(10)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.