Problem 51312. Count the square-full divisors of a number
A square-full number has a prime factorization in which all exponents are 2 or greater. For example, 72 =
is square-full, but 45 =
is not. The number 1 is considered square-full. Therefore, 12 has two square-full divisors (1 and 4), while 48 has 4 (1, 4, 8, and 16).
Write a function that returns the number of square-full divisors of the input number.
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers7
Suggested Problems
-
13182 Solvers
-
Calculate Euler's phi function
88 Solvers
-
417 Solvers
-
344 Solvers
-
Highly divisible triangular number (inspired by Project Euler 12)
106 Solvers
More from this Author269
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!