Search for a tool
Primorial

Tool to compute a primorial. Primorial n# is the product of all prime numbers inferior or equal to n, or the product of all n first prime numbers (it depend on the selected definition)

Results

Primorial -

Tag(s) : Arithmetics

Share
Share
dCode and more

dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!


Please, check our dCode Discord community for help requests!
NB: for encrypted messages, test our automatic cipher identifier!


Feedback and suggestions are welcome so that dCode offers the best 'Primorial' tool for free! Thank you!

Primorial

Primorial Calculator N#




Answers to Questions (FAQ)

What is a primorial? (Definition)

The term primorial refers to two separate definitions/formulae according to some uses:

(1) Primorial defined as the product of all prime numbers inferior or equal to $ n $ is a multiplication conditioned par a primality test of the numbers inferior or equal to $ n $, see OEIS here

Example: $ 6\# = 2 \times 3 \times 5 = 30 $

(2) Primorial defined as a product of the $ n $ first primes is equivalent to a multiplication of the list of the first $ n $ prime numbers, see OEIS here

Example: $ 4\# = 2 \times 3 \times 5 \times 7 = 210 $

The primorial of p is written with the character sharp: p# or $ p\# $

By convention $ 1\# = 1 $

What is the primorial function?

The primorial function is the function that at a natural integer $ n $ associates the value $ n\# $

How to calculate a primorial?

The primorial calculation is a succession of multiplication of prime numbers. According to definitions (1) and (2):

Example:

nn#
(1)
n#
(2)
112
226
3630
46210
5302310
63030030
7210510510
82109699690
9210223092870
102106469693230
112310200560490130

Lists (1) and (2) contain the same numbers but (1) have repeated elements.

Source code

dCode retains ownership of the "Primorial" source code. Any algorithm for the "Primorial" algorithm, applet or snippet or script (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or any "Primorial" functions (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) or any database download or API access for "Primorial" or any other element are not public (except explicit open source licence like Creative Commons). Same with the download for offline use on PC, mobile, tablet, iPhone or Android app.
Reminder: dCode is an educational and teaching resource, accessible online for free and for everyone.

Cite dCode

The content of the page "Primorial" and its results may be freely copied and reused, including for commercial purposes, provided that dCode.fr is cited as the source. Exporting the results is free and can be done simply by clicking on the export icons ⤓ (.csv or .txt format) or ⧉ (copy and paste).
To cite dCode.fr on another website, use the link: https://www.dcode.fr/primorial
In a scientific article or book, the recommended bibliographic citation is: Primorial on dCode.fr [online website], retrieved on 2025-04-14, https://www.dcode.fr/primorial

Need Help ?

Please, check our dCode Discord community for help requests!
NB: for encrypted messages, test our automatic cipher identifier!

Questions / Comments

Feedback and suggestions are welcome so that dCode offers the best 'Primorial' tool for free! Thank you!


https://www.dcode.fr/primorial
© 2025 dCode — The ultimate collection of tools for games, math, and puzzles.
 
Feedback