[math-fun] Detecting binomial coefficients

Suppose we are given the prime factorization of a rather large integer Q. Is there a good algorithm for determining from this whether the number Q is a binomial coefficient? I.e., whether there exist positive integers k < n such that Q = n! / (k! (n-k)!) . —Dan