Given a number num. You are tasked with finding the smallest number S, such that num is a factor of S! (S factorial).

Example 1:
Input: num = 6
Output: 3
Explanation: 3! = 6 and 6 is
divisible by 6.
Example 2:
Input: num = 800
Output: 10
Exaplantion: 10! = 3628800 and 3628800
is divisible by 800.

Your Task:
You don't need to read or print anyhting. Your task is to complete the function findFact() which takes num as input parameter and returns smallest number whose factorial is divisible by num.

Expected Space Complexity: O(sqrt(num))
Expected Space Compplexity: O(sqrt(num))

Constraints:
1 <= num <= 10^{12}

见题面

见题面