Number Theory Question

#1

He will provide you with a number d and you have to find the minimum (smallest) number N such that it has exactly 2^d positive divisors.

In mathematics, a divisor d is a number which leaves no remainder on dividing the number n, i.e, the number n is a multiple of d.

Since the output can be very large, print the answer by applying modulo by 1000000007 (1e9+7).

Sample TestCase 1:
Input
2
Output
6
Explanation

d = 2

Number N should have exactly = 2^2 = 4 divisors

The smallest number with 4 divisors is 6.

The divisors of 6 are 1, 2, 3 and 6.

#2

Hey @ravig8233 Take a look at this link https://stackoverflow.com/questions/31270226/how-to-calculate-smallest-number-with-certain-number-of-divisors ,the first answer caters to your query.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.