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: 
.
, 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 
.
. 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.
Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers1
Suggested Problems
-
Return the 3n+1 sequence for n
8491 Solvers
-
156 Solvers
-
Generalized Laguerre polynomials
65 Solvers
-
Chebyshev polynomials of the 1st Kind
80 Solvers
-
Convert to Binary Coded Decimal
152 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
