Work out primorial instantly with clear inputs, formula shown and shareable results.
The primorial multiplies all primes up to a limit. It appears in Euclid's proof of the infinitude of primes, where p# + 1 must have a prime factor larger than p.
Primorial
n# = product of all primes p ≤ n
2 × 3 × 5 × 7 × 11 × 13 × 17 × 19 = 9699690.
Because p# + 1 leaves remainder 1 when divided by every prime up to p, so its prime factors must be larger — hence no largest prime.