Practice Maximize Number of Nice Divisors
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Choose a positive integer n with at most primeFactors prime factors counted with multiplicity. A divisor is nice when it is divisible by every distinct prime factor of n. Maximize the number of nice divisors and return that count modulo 10^9 + 7, rather than returning n.
Source: Maximize Number of Nice Divisors on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
primeFactors = 5
Output
6
# Example 2
Input
primeFactors = 8
Output
18
Constraints
1 <= primeFactors <= 10^9
Related LeetCode Problems
Practice more problems similar to Maximize Number of Nice Divisors.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.