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
-
487 Solvers
-
Project Euler: Problem 3, Largest prime factor
1639 Solvers
-
334 Solvers
-
Integer sequence - 2 : Kolakoski sequence
180 Solvers
-
Compute the Sequence of the Day
22 Solvers
More from this Author312
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!