This question already has an answer here:
For the purposes of this question, the prime factorial of a number n is the result of multiplying all prime numbers smaller than n, and then multiplying the result by n.
Write a program or function to find the prime factorial of a number, as outlined above.
An integer n where n is greater than one, and the prime factorial of n is smaller than the largest integer your language can support. However, remember this standard loophole. Reasonable integer limits only.
The prime factorial of the input.
4 -> 24 7 -> 210 32 -> 641795684160
This is code-golf, lowest score in bytes wins!