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:
0100 0111 1111 1100 0000 0000 0000 0000 = 100 0111 1111 1100 0000 0000 0000 0000
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
1 225
1 224
1 223
1 222
1 221
1 220
1 219
1 218
1 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
0 23
0 22
0 21
0 20
0
4. Multiply each bit by its corresponding power of 2 and add all the terms up.
100 0111 1111 1100 0000 0000 0000 0000(2) =
(1 × 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 + 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 + 0 × 23 + 0 × 22 + 0 × 21 + 0 × 20)(10) =
(1 073 741 824 + 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 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0)(10) =
(1 073 741 824 + 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)(10) =
1 207 697 408(10)
5. If needed, adjust the sign of the integer number by the first digit (leftmost) of the signed binary:
0100 0111 1111 1100 0000 0000 0000 0000(2) = 1 207 697 408(10)
The number 0100 0111 1111 1100 0000 0000 0000 0000(2) converted from a signed binary (base two) and written as an integer in decimal system (base ten):
0100 0111 1111 1100 0000 0000 0000 0000(2) = 1 207 697 408(10)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.