In a signed binary in two's complement representation, the first bit (the leftmost) indicates the sign, 1 = negative, 0 = positive.
2. Get the binary representation in one's complement.
* Run this step only if the number is negative *
Note on binary subtraction rules:
11 - 1 = 10; 10 - 1 = 1; 1 - 0 = 1; 1 - 1 = 0.
Subtract 1 from the initial binary number.
1010 1010 1010 1000 1010 1011 0101 1010 1101 0111 1101 0101 1011 0100 1100 1101 - 1 = 1010 1010 1010 1000 1010 1011 0101 1010 1101 0111 1101 0101 1011 0100 1100 1100
3. Get the binary representation of the positive (unsigned) number.
* Run this step only if the number is negative *
Flip all the bits of the signed binary in one's complement representation (reverse the digits) - replace the bits set on 1 with 0s and the bits on 0 with 1s:
!(1010 1010 1010 1000 1010 1011 0101 1010 1101 0111 1101 0101 1011 0100 1100 1100) = 0101 0101 0101 0111 0101 0100 1010 0101 0010 1000 0010 1010 0100 1011 0011 0011
4. Map the unsigned binary number's digits versus the corresponding powers of 2 that their place value represent:
263
0 262
1 261
0 260
1 259
0 258
1 257
0 256
1 255
0 254
1 253
0 252
1 251
0 250
1 249
1 248
1 247
0 246
1 245
0 244
1 243
0 242
1 241
0 240
0 239
1 238
0 237
1 236
0 235
0 234
1 233
0 232
1 231
0 230
0 229
1 228
0 227
1 226
0 225
0 224
0 223
0 222
0 221
1 220
0 219
1 218
0 217
1 216
0 215
0 214
1 213
0 212
0 211
1 210
0 29
1 28
1 27
0 26
0 25
1 24
1 23
0 22
0 21
1 20
1
5. Multiply each bit by its corresponding power of 2 and add all the terms up.
0101 0101 0101 0111 0101 0100 1010 0101 0010 1000 0010 1010 0100 1011 0011 0011(2) =
(0 × 263 + 1 × 262 + 0 × 261 + 1 × 260 + 0 × 259 + 1 × 258 + 0 × 257 + 1 × 256 + 0 × 255 + 1 × 254 + 0 × 253 + 1 × 252 + 0 × 251 + 1 × 250 + 1 × 249 + 1 × 248 + 0 × 247 + 1 × 246 + 0 × 245 + 1 × 244 + 0 × 243 + 1 × 242 + 0 × 241 + 0 × 240 + 1 × 239 + 0 × 238 + 1 × 237 + 0 × 236 + 0 × 235 + 1 × 234 + 0 × 233 + 1 × 232 + 0 × 231 + 0 × 230 + 1 × 229 + 0 × 228 + 1 × 227 + 0 × 226 + 0 × 225 + 0 × 224 + 0 × 223 + 0 × 222 + 1 × 221 + 0 × 220 + 1 × 219 + 0 × 218 + 1 × 217 + 0 × 216 + 0 × 215 + 1 × 214 + 0 × 213 + 0 × 212 + 1 × 211 + 0 × 210 + 1 × 29 + 1 × 28 + 0 × 27 + 0 × 26 + 1 × 25 + 1 × 24 + 0 × 23 + 0 × 22 + 1 × 21 + 1 × 20)(10) =
(0 + 4 611 686 018 427 387 904 + 0 + 1 152 921 504 606 846 976 + 0 + 288 230 376 151 711 744 + 0 + 72 057 594 037 927 936 + 0 + 18 014 398 509 481 984 + 0 + 4 503 599 627 370 496 + 0 + 1 125 899 906 842 624 + 562 949 953 421 312 + 281 474 976 710 656 + 0 + 70 368 744 177 664 + 0 + 17 592 186 044 416 + 0 + 4 398 046 511 104 + 0 + 0 + 549 755 813 888 + 0 + 137 438 953 472 + 0 + 0 + 17 179 869 184 + 0 + 4 294 967 296 + 0 + 0 + 536 870 912 + 0 + 134 217 728 + 0 + 0 + 0 + 0 + 0 + 2 097 152 + 0 + 524 288 + 0 + 131 072 + 0 + 0 + 16 384 + 0 + 0 + 2 048 + 0 + 512 + 256 + 0 + 0 + 32 + 16 + 0 + 0 + 2 + 1)(10) =
(4 611 686 018 427 387 904 + 1 152 921 504 606 846 976 + 288 230 376 151 711 744 + 72 057 594 037 927 936 + 18 014 398 509 481 984 + 4 503 599 627 370 496 + 1 125 899 906 842 624 + 562 949 953 421 312 + 281 474 976 710 656 + 70 368 744 177 664 + 17 592 186 044 416 + 4 398 046 511 104 + 549 755 813 888 + 137 438 953 472 + 17 179 869 184 + 4 294 967 296 + 536 870 912 + 134 217 728 + 2 097 152 + 524 288 + 131 072 + 16 384 + 2 048 + 512 + 256 + 32 + 16 + 2 + 1)(10) =
6 149 476 884 517 899 059(10)
6. If needed, adjust the sign of the integer number by the first digit (leftmost) of the signed binary:
1010 1010 1010 1000 1010 1011 0101 1010 1101 0111 1101 0101 1011 0100 1100 1101(2) = -6 149 476 884 517 899 059(10)
The signed binary number in two's complement representation 1010 1010 1010 1000 1010 1011 0101 1010 1101 0111 1101 0101 1011 0100 1100 1101(2) converted and written as an integer in decimal system (base ten):
1010 1010 1010 1000 1010 1011 0101 1010 1101 0111 1101 0101 1011 0100 1100 1101(2) = -6 149 476 884 517 899 059(10)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.