Timer is Running

Product of Prime Factors
Submissions: 49   Accuracy:

38.76%

  Difficulty: Easy   Marks: 2

Given a number N find the product of all unique prime factors of that number.
 

Example 1:

Input:
N = 5
Output:
5
Explanation:
5 has 1 prime factor 
i.e 5 only.


Example 2:

Input:
N = 24
Output:
6
Explanation:
24 has 2 prime factors 
3 and 2 where 3*2 = 6


Your Task:
You don't need to read input or print anything. Your task is to complete the function primeProduct() which takes an integer N as input parameters and returns an integer, product of all the prime factors of N.

 

Expected Time Complexity: O(sqrt(N))
Expected Space Complexity: O(1)

 

Constraints:
1 <= N <= 105

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Sujnesh Mishra
Author: sujnesh


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.