function length_of_factorial(N) {
if (N < 2) return 1;
sum = 0;
for (i = 2; i <= N; i++) {
sum += Math.log(i) / Math.log(10)
}
return Math.floor(sum) + 1
}
57 chars
N = _fArgs[0]
M = Math
s = 1
for (;N;)
s += M.log(N--) / M.LN10
return s | 0
52 chars
return ~~((Math.log(n = _fArgs[0]) * (.5 + n) - n)/2.30258) + 1