2. Multiply each bit by its corresponding power of 2 and add all the terms up.
110 1110 1010 1010 1100 1010 0110 1001(2) =
(1 × 230 + 1 × 229 + 0 × 228 + 1 × 227 + 1 × 226 + 1 × 225 + 0 × 224 + 1 × 223 + 0 × 222 + 1 × 221 + 0 × 220 + 1 × 219 + 0 × 218 + 1 × 217 + 0 × 216 + 1 × 215 + 1 × 214 + 0 × 213 + 0 × 212 + 1 × 211 + 0 × 210 + 1 × 29 + 0 × 28 + 0 × 27 + 1 × 26 + 1 × 25 + 0 × 24 + 1 × 23 + 0 × 22 + 0 × 21 + 1 × 20)(10) =
(1 073 741 824 + 536 870 912 + 0 + 134 217 728 + 67 108 864 + 33 554 432 + 0 + 8 388 608 + 0 + 2 097 152 + 0 + 524 288 + 0 + 131 072 + 0 + 32 768 + 16 384 + 0 + 0 + 2 048 + 0 + 512 + 0 + 0 + 64 + 32 + 0 + 8 + 0 + 0 + 1)(10) =
(1 073 741 824 + 536 870 912 + 134 217 728 + 67 108 864 + 33 554 432 + 8 388 608 + 2 097 152 + 524 288 + 131 072 + 32 768 + 16 384 + 2 048 + 512 + 64 + 32 + 8 + 1)(10) =
1 856 686 697(10)
The number 110 1110 1010 1010 1100 1010 0110 1001(2) converted from an unsigned binary (in base 2) and written as a positive integer (with no sign) in decimal system (in base ten):
110 1110 1010 1010 1100 1010 0110 1001(2) = 1 856 686 697(10)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.