2. Multiply each bit by its corresponding power of 2 and add all the terms up.
1 1101 1100 1101 0110 0101 0101 1111(2) =
(1 × 228 + 1 × 227 + 1 × 226 + 0 × 225 + 1 × 224 + 1 × 223 + 1 × 222 + 0 × 221 + 0 × 220 + 1 × 219 + 1 × 218 + 0 × 217 + 1 × 216 + 0 × 215 + 1 × 214 + 1 × 213 + 0 × 212 + 0 × 211 + 1 × 210 + 0 × 29 + 1 × 28 + 0 × 27 + 1 × 26 + 0 × 25 + 1 × 24 + 1 × 23 + 1 × 22 + 1 × 21 + 1 × 20)(10) =
(268 435 456 + 134 217 728 + 67 108 864 + 0 + 16 777 216 + 8 388 608 + 4 194 304 + 0 + 0 + 524 288 + 262 144 + 0 + 65 536 + 0 + 16 384 + 8 192 + 0 + 0 + 1 024 + 0 + 256 + 0 + 64 + 0 + 16 + 8 + 4 + 2 + 1)(10) =
(268 435 456 + 134 217 728 + 67 108 864 + 16 777 216 + 8 388 608 + 4 194 304 + 524 288 + 262 144 + 65 536 + 16 384 + 8 192 + 1 024 + 256 + 64 + 16 + 8 + 4 + 2 + 1)(10) =
500 000 095(10)
The number 1 1101 1100 1101 0110 0101 0101 1111(2) converted from an unsigned binary (in base 2) and written as a positive integer (with no sign) in decimal system (in base ten):
1 1101 1100 1101 0110 0101 0101 1111(2) = 500 000 095(10)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.