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
-
Given two arrays, find the maximum overlap
1672 Solvers
-
168 Solvers
-
Project Euler: Problem 1, Multiples of 3 and 5
3612 Solvers
-
Remove the two elements next to NaN value
684 Solvers
-
364 Solvers
More from this Author314
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!