There is a neat mathematical solution to this problem.
Rather than obtaining the product of a series by multiplying each number, you can use their log values. The noted principle is:
log(a*b) = log(a) + log(b)
For the example series (2, 3, 66, 435, 444), the brute-force product is calculated as 2 * 3 * 66 * 435 * 44 = 76,483,440.
However, you can also obtain the product from the sum of the logs. For a series (n1, n2, n3, n4,...) the product of the series is: 10 ^ (log(n1) + log(n2) + log(n3) + log(n4)...)
log(2) = 0.30103
log(3) = 0.47712
log(66) = 1.8195
log(435) = 2.6384
log(444) = 2.6474
The sum of the values is roughly 7.8835. The product of the series is 10 ^ 7.8835 (76,483,440).
Since you're looking for the log of the product of the series, just the sum of the individual log() values, 7.8835. That's it.