In mathematics, and more particularly in number theory, primorial, denoted by "#", is a function from natural numbers to natural numbers similar to the factorial function, but rather than successively multiplying positive integers, the function only multiplies prime numbers.

Look up -ial in Wiktionary, the free dictionary.

The name "primorial", coined by Harvey Dubner, draws an analogy to primes similar to the way the name "factorial" relates to factors.

For the nth prime number p_n, the primorial p_n# is defined as the product of the first n primes:^[1][2]

${\displaystyle p_{n}\#=\prod _{k=1}^{n}p_{k}}$,

where p_k is the kth prime number. For instance, p₅# signifies the product of the first 5 primes:

${\displaystyle p_{5}\#=2\times 3\times 5\times 7\times 11=2310.}$

The first five primorials p_n# are:

2, 6, 30, 210, 2310 (sequence A002110 in the OEIS).

The sequence also includes p₀# = 1 as empty product. Asymptotically, primorials p_n# grow according to:

${\displaystyle p_{n}\#=e^{(1+o(1))n\log n},}$

where o( ) is Little O notation.^[2]

In general, for a positive integer n, its primorial, n#, is the product of the primes that are not greater than n; that is,^[1][3]

${\displaystyle n\#=\prod _{p\leq n \atop p{\text{ prime}}}p=\prod _{i=1}^{\pi (n)}p_{i}=p_{\pi (n)}\#}$,

where π(n) is the prime-counting function (sequence A000720 in the OEIS), which gives the number of primes ≤ n. This is equivalent to:

${\displaystyle n\#={\begin{cases}1&{\text{if }}n=0,\ 1\\(n-1)\#\times n&{\text{if }}n{\text{ is prime}}\\(n-1)\#&{\text{if }}n{\text{ is composite}}.\end{cases}}}$

For example, 12# represents the product of those primes ≤ 12:

${\displaystyle 12\#=2\times 3\times 5\times 7\times 11=2310.}$

Since π(12) = 5, this can be calculated as:

${\displaystyle 12\#=p_{\pi (12)}\#=p_{5}\#=2310.}$

Consider the first 12 values of n#:

1, 2, 6, 6, 30, 30, 210, 210, 210, 210, 2310, 2310.

We see that for composite n every term n# simply duplicates the preceding term (n − 1)#, as given in the definition. In the above example we have 12# = p₅# = 11# since 12 is a composite number.

Primorials are related to the first Chebyshev function, written ϑ(n) or θ(n) according to:

${\displaystyle \ln(n\#)=\vartheta (n).}$^[4]

Since ϑ(n) asymptotically approaches n for large values of n, primorials therefore grow according to:

${\displaystyle n\#=e^{(1+o(1))n}.}$

The idea of multiplying all known primes occurs in some proofs of the infinitude of the prime numbers, where it is used to derive the existence of another prime.

• Let p and q be two adjacent prime numbers. Given any ${\displaystyle n\in \mathbb {N} }$, where ${\displaystyle p\leq n<q}$:

${\displaystyle n\#=p\#}$

• For the Primorial, the following approximation is known:^[5]

${\displaystyle n\#\leq 4^{n}}$.

Notes:

1. Using elementary methods, mathematician Denis Hanson showed that ${\displaystyle n\#\leq 3^{n}}$^[6]
2. Using more advanced methods, Rosser and Schoenfeld showed that ${\displaystyle n\#\leq (2.763)^{n}}$^[7]
3. Rosser and Schoenfeld in Theorem 4, formula 3.14, showed that for ${\displaystyle n\geq 563}$, ${\displaystyle n\#\geq (2.22)^{n}}$^[7]

• Furthermore:

${\displaystyle \lim _{n\to \infty }{\sqrt[{n}]{n\#}}=e}$

For ${\displaystyle n<10^{11}}$, the values are smaller than e,^[8] but for larger n, the values of the function exceed the limit e and oscillate infinitely around e later on.

• Let ${\displaystyle p_{k}}$ be the k-th prime, then ${\displaystyle p_{k}\#}$ has exactly ${\displaystyle 2^{k}}$ divisors. For example, ${\displaystyle 2\#}$ has 2 divisors, ${\displaystyle 3\#}$ has 4 divisors, ${\displaystyle 5\#}$ has 8 divisors and ${\displaystyle 97\#}$ already has ${\displaystyle 2^{25}}$ divisors, as 97 is the 25th prime.
• The sum of the reciprocal values of the primorial converges towards a constant

${\displaystyle \sum _{p\,\in \,\mathbb {P} }{1 \over p\#}={1 \over 2}+{1 \over 6}+{1 \over 30}+\ldots =0{.}7052301717918\ldots }$

The Engel expansion of this number results in the sequence of the prime numbers (See (sequence A064648 in the OEIS))

• According to Euclid's theorem, ${\displaystyle p\#+1}$ is used to prove the infinitude of the prime numbers.

Primorials play a role in the search for prime numbers in additive arithmetic progressions. For instance, 2236133941 + 23# results in a prime, beginning a sequence of thirteen primes found by repeatedly adding 23#, and ending with 5136341251. 23# is also the common difference in arithmetic progressions of fifteen and sixteen primes.

Every highly composite number is a product of primorials (e.g. 360 = 2 × 6 × 30).^[9]

Primorials are all square-free integers, and each one has more distinct prime factors than any number smaller than it. For each primorial n, the fraction φ(n)/n is smaller than for any lesser integer, where φ is the Euler totient function.

Any completely multiplicative function is defined by its values at primorials, since it is defined by its values at primes, which can be recovered by division of adjacent values.

Base systems corresponding to primorials (such as base 30, not to be confused with the primorial number system) have a lower proportion of repeating fractions than any smaller base.

Every primorial is a sparsely totient number.^[10]

The n-compositorial of a composite number n is the product of all composite numbers up to and including n.^[11] The n-compositorial is equal to the n-factorial divided by the primorial n#. The compositorials are

1, 4, 24, 192, 1728, 17280, 207360, 2903040, 43545600, 696729600, ...^[12]

The Riemann zeta function at positive integers greater than one can be expressed^[13] by using the primorial function and Jordan's totient function J_k(n):

${\displaystyle \zeta (k)={\frac {2^{k}}{2^{k}-1}}+\sum _{r=2}^{\infty }{\frac {(p_{r-1}\#)^{k}}{J_{k}(p_{r}\#)}},\quad k=2,3,\dots }$

• Bonse's inequality
• Chebyshev function
• Primorial number system
• Primorial prime