Given an integer n, the primorial of n, , is defined as product of all primes from 2 to the n-th prime. In other words, if is the n-th prime number: .
For this problem, we want to calculate the hyperprimorial of n, which we will define as: .
For example:
; and
(with 1,650,583 digits).
From what we see above, calculating hyperprimorial will quickly involve extremely large integers, as such, please return only the last 6 digits of . Therefore, in the example above the final output should be: and .
-----------------------------
NOTE: OEIS's "hyperprimorial" sequence, #A076265, is not the same as what is defined in this problem.
Solve

Solution Stats

5 Solutions

4 Solvers

Last Solution submitted on Aug 01, 2026

Last 200 Solutions

Solution Comments

Show comments

Problem Recent Solvers4

Chris Cleveland George Berken David Hill Hoang Minh Tri

Suggested Problems

More from this Author116

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!