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:
0000 0000 0000 1000 0000 0011 1100 0000 0000 1111 1010 0001 0000 0011 1111 1001 = 000 0000 0000 1000 0000 0011 1100 0000 0000 1111 1010 0001 0000 0011 1111 1001
3. Map the unsigned binary number's digits versus the corresponding powers of 2 that their place value represent:
262
0 261
0 260
0 259
0 258
0 257
0 256
0 255
0 254
0 253
0 252
0 251
1 250
0 249
0 248
0 247
0 246
0 245
0 244
0 243
0 242
0 241
1 240
1 239
1 238
1 237
0 236
0 235
0 234
0 233
0 232
0 231
0 230
0 229
0 228
0 227
1 226
1 225
1 224
1 223
1 222
0 221
1 220
0 219
0 218
0 217
0 216
1 215
0 214
0 213
0 212
0 211
0 210
0 29
1 28
1 27
1 26
1 25
1 24
1 23
1 22
0 21
0 20
1
4. Multiply each bit by its corresponding power of 2 and add all the terms up.
000 0000 0000 1000 0000 0011 1100 0000 0000 1111 1010 0001 0000 0011 1111 1001(2) =
(0 × 262 + 0 × 261 + 0 × 260 + 0 × 259 + 0 × 258 + 0 × 257 + 0 × 256 + 0 × 255 + 0 × 254 + 0 × 253 + 0 × 252 + 1 × 251 + 0 × 250 + 0 × 249 + 0 × 248 + 0 × 247 + 0 × 246 + 0 × 245 + 0 × 244 + 0 × 243 + 0 × 242 + 1 × 241 + 1 × 240 + 1 × 239 + 1 × 238 + 0 × 237 + 0 × 236 + 0 × 235 + 0 × 234 + 0 × 233 + 0 × 232 + 0 × 231 + 0 × 230 + 0 × 229 + 0 × 228 + 1 × 227 + 1 × 226 + 1 × 225 + 1 × 224 + 1 × 223 + 0 × 222 + 1 × 221 + 0 × 220 + 0 × 219 + 0 × 218 + 0 × 217 + 1 × 216 + 0 × 215 + 0 × 214 + 0 × 213 + 0 × 212 + 0 × 211 + 0 × 210 + 1 × 29 + 1 × 28 + 1 × 27 + 1 × 26 + 1 × 25 + 1 × 24 + 1 × 23 + 0 × 22 + 0 × 21 + 1 × 20)(10) =
(0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 2 251 799 813 685 248 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 2 199 023 255 552 + 1 099 511 627 776 + 549 755 813 888 + 274 877 906 944 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 134 217 728 + 67 108 864 + 33 554 432 + 16 777 216 + 8 388 608 + 0 + 2 097 152 + 0 + 0 + 0 + 0 + 65 536 + 0 + 0 + 0 + 0 + 0 + 0 + 512 + 256 + 128 + 64 + 32 + 16 + 8 + 0 + 0 + 1)(10) =
(2 251 799 813 685 248 + 2 199 023 255 552 + 1 099 511 627 776 + 549 755 813 888 + 274 877 906 944 + 134 217 728 + 67 108 864 + 33 554 432 + 16 777 216 + 8 388 608 + 2 097 152 + 65 536 + 512 + 256 + 128 + 64 + 32 + 16 + 8 + 1)(10) =
2 255 923 244 499 961(10)
5. If needed, adjust the sign of the integer number by the first digit (leftmost) of the signed binary:
0000 0000 0000 1000 0000 0011 1100 0000 0000 1111 1010 0001 0000 0011 1111 1001(2) = 2 255 923 244 499 961(10)
The number 0000 0000 0000 1000 0000 0011 1100 0000 0000 1111 1010 0001 0000 0011 1111 1001(2) converted from a signed binary (base two) and written as an integer in decimal system (base ten):
0000 0000 0000 1000 0000 0011 1100 0000 0000 1111 1010 0001 0000 0011 1111 1001(2) = 2 255 923 244 499 961(10)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.