1679616000

Appears in sequences

• a(1)=1, a(n) = p*a(n-1), where p is the smallest prime satisfying gcd(n,p)=1.at n=22A160505
• A multiplicative encoding (compressed) for the exponents of 2 obtained when using Shevelev's algorithm for computing A002326.at n=39A292265