>>5
It is linear in time if we ignore that bignum operations. Wikipedia says that the best known multiplication algorithm is O(n log(n)), therefore theoretically it could be O(n² log(n)), but it will depend on your Scheme implementation.
What are some cases where 1000000! is interesting? I thought 70! was already well over the number of observable particles in the universe, why would you need to compute and reverse it?