Problem 51312. Count the square-full divisors of a number

ChrisR

8 solvers

0 likes

Solve

Solve Later

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.

Solve

Solution Stats

19 Solutions

Last Solution submitted on May 31, 2026

Last 200 Solutions

Solution Comments

Show comments

Problem Recent Solvers8

Suggested Problems

Figurate number triangle

100 Solvers
Generate N equally spaced intervals between -L and L

952 Solvers
Find and replaces spaces from a input string with *

172 Solvers
Smith numbers

777 Solvers
Divisible by 4

374 Solvers

More from this Author325

Compute a row of the Kimberling shuffle

14 Solvers
Compute expulsions from the Kimberling shuffle

14 Solvers
Determine whether a number is unprimeable

17 Solvers
Evaluate the Struve function

21 Solvers
Create a sequence of primes p such that p > n π(p)

15 Solvers

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!