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 0000 0000 0000 1001 1001 1001 0011 0101 0110 0011 1100 1011 0110 = 000 0000 0000 0000 0000 0000 1001 1001 1001 0011 0101 0110 0011 1100 1011 0110
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
0 250
0 249
0 248
0 247
0 246
0 245
0 244
0 243
0 242
0 241
0 240
0 239
1 238
0 237
0 236
1 235
1 234
0 233
0 232
1 231
1 230
0 229
0 228
1 227
0 226
0 225
1 224
1 223
0 222
1 221
0 220
1 219
0 218
1 217
1 216
0 215
0 214
0 213
1 212
1 211
1 210
1 29
0 28
0 27
1 26
0 25
1 24
1 23
0 22
1 21
1 20
0
4. Multiply each bit by its corresponding power of 2 and add all the terms up.
000 0000 0000 0000 0000 0000 1001 1001 1001 0011 0101 0110 0011 1100 1011 0110(2) =
(0 × 262 + 0 × 261 + 0 × 260 + 0 × 259 + 0 × 258 + 0 × 257 + 0 × 256 + 0 × 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 + 1 × 239 + 0 × 238 + 0 × 237 + 1 × 236 + 1 × 235 + 0 × 234 + 0 × 233 + 1 × 232 + 1 × 231 + 0 × 230 + 0 × 229 + 1 × 228 + 0 × 227 + 0 × 226 + 1 × 225 + 1 × 224 + 0 × 223 + 1 × 222 + 0 × 221 + 1 × 220 + 0 × 219 + 1 × 218 + 1 × 217 + 0 × 216 + 0 × 215 + 0 × 214 + 1 × 213 + 1 × 212 + 1 × 211 + 1 × 210 + 0 × 29 + 0 × 28 + 1 × 27 + 0 × 26 + 1 × 25 + 1 × 24 + 0 × 23 + 1 × 22 + 1 × 21 + 0 × 20)(10) =
(0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 549 755 813 888 + 0 + 0 + 68 719 476 736 + 34 359 738 368 + 0 + 0 + 4 294 967 296 + 2 147 483 648 + 0 + 0 + 268 435 456 + 0 + 0 + 33 554 432 + 16 777 216 + 0 + 4 194 304 + 0 + 1 048 576 + 0 + 262 144 + 131 072 + 0 + 0 + 0 + 8 192 + 4 096 + 2 048 + 1 024 + 0 + 0 + 128 + 0 + 32 + 16 + 0 + 4 + 2 + 0)(10) =
(549 755 813 888 + 68 719 476 736 + 34 359 738 368 + 4 294 967 296 + 2 147 483 648 + 268 435 456 + 33 554 432 + 16 777 216 + 4 194 304 + 1 048 576 + 262 144 + 131 072 + 8 192 + 4 096 + 2 048 + 1 024 + 128 + 32 + 16 + 4 + 2)(10) =
659 601 898 678(10)
5. If needed, adjust the sign of the integer number by the first digit (leftmost) of the signed binary:
0000 0000 0000 0000 0000 0000 1001 1001 1001 0011 0101 0110 0011 1100 1011 0110(2) = 659 601 898 678(10)
The number 0000 0000 0000 0000 0000 0000 1001 1001 1001 0011 0101 0110 0011 1100 1011 0110(2) converted from a signed binary (base two) and written as an integer in decimal system (base ten):
0000 0000 0000 0000 0000 0000 1001 1001 1001 0011 0101 0110 0011 1100 1011 0110(2) = 659 601 898 678(10)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.