1. Map the unsigned binary number's digits versus the corresponding powers of 2 that their place value represent:
234
1 233
1 232
0 231
1 230
1 229
1 228
1 227
1 226
1 225
0 224
0 223
0 222
0 221
1 220
0 219
1 218
0 217
0 216
0 215
1 214
1 213
1 212
0 211
0 210
0 29
1 28
1 27
1 26
1 25
1 24
1 23
0 22
0 21
1 20
1
2. Multiply each bit by its corresponding power of 2 and add all the terms up:
110 1111 1100 0010 1000 1110 0011 1111 0011(2) =
(1 × 234 + 1 × 233 + 0 × 232 + 1 × 231 + 1 × 230 + 1 × 229 + 1 × 228 + 1 × 227 + 1 × 226 + 0 × 225 + 0 × 224 + 0 × 223 + 0 × 222 + 1 × 221 + 0 × 220 + 1 × 219 + 0 × 218 + 0 × 217 + 0 × 216 + 1 × 215 + 1 × 214 + 1 × 213 + 0 × 212 + 0 × 211 + 0 × 210 + 1 × 29 + 1 × 28 + 1 × 27 + 1 × 26 + 1 × 25 + 1 × 24 + 0 × 23 + 0 × 22 + 1 × 21 + 1 × 20)(10) =
(17 179 869 184 + 8 589 934 592 + 0 + 2 147 483 648 + 1 073 741 824 + 536 870 912 + 268 435 456 + 134 217 728 + 67 108 864 + 0 + 0 + 0 + 0 + 2 097 152 + 0 + 524 288 + 0 + 0 + 0 + 32 768 + 16 384 + 8 192 + 0 + 0 + 0 + 512 + 256 + 128 + 64 + 32 + 16 + 0 + 0 + 2 + 1)(10) =
(17 179 869 184 + 8 589 934 592 + 2 147 483 648 + 1 073 741 824 + 536 870 912 + 268 435 456 + 134 217 728 + 67 108 864 + 2 097 152 + 524 288 + 32 768 + 16 384 + 8 192 + 512 + 256 + 128 + 64 + 32 + 16 + 2 + 1)(10) =
30 000 342 003(10)