1. 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
1 226
0 225
0 224
1 223
1 222
1 221
1 220
0 219
0 218
1 217
1 216
1 215
1 214
0 213
0 212
1 211
1 210
1 29
1 28
0 27
0 26
0 25
0 24
0 23
0 22
0 21
1 20
1
2. Multiply each bit by its corresponding power of 2 and add all the terms up:
100 1001 1110 0111 1001 1110 0000 0011(2) =
(1 × 230 + 0 × 229 + 0 × 228 + 1 × 227 + 0 × 226 + 0 × 225 + 1 × 224 + 1 × 223 + 1 × 222 + 1 × 221 + 0 × 220 + 0 × 219 + 1 × 218 + 1 × 217 + 1 × 216 + 1 × 215 + 0 × 214 + 0 × 213 + 1 × 212 + 1 × 211 + 1 × 210 + 1 × 29 + 0 × 28 + 0 × 27 + 0 × 26 + 0 × 25 + 0 × 24 + 0 × 23 + 0 × 22 + 1 × 21 + 1 × 20)(10) =
(1 073 741 824 + 0 + 0 + 134 217 728 + 0 + 0 + 16 777 216 + 8 388 608 + 4 194 304 + 2 097 152 + 0 + 0 + 262 144 + 131 072 + 65 536 + 32 768 + 0 + 0 + 4 096 + 2 048 + 1 024 + 512 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 2 + 1)(10) =
(1 073 741 824 + 134 217 728 + 16 777 216 + 8 388 608 + 4 194 304 + 2 097 152 + 262 144 + 131 072 + 65 536 + 32 768 + 4 096 + 2 048 + 1 024 + 512 + 2 + 1)(10) =
1 239 916 035(10)
Conclusion: