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

• Created by ChrisR
• Appears in Cody Problems in Japanese

×

Like (0)

Difficulty:

(222)

Rate

• Solve Later   
• Add To GroupÂ

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

44.44% Correct | 55.56% Incorrect

• 18 Solutions
• 7 Solvers

Last Solution submitted on May 14, 2022

Last 200 Solutions

Solution Comments

Problem Recent Solvers7

Suggested Problems

• Reverse Run-Length Encoder

  2632 Solvers

• Return unique values without sorting

  934 Solvers

• QWERTY Shift Code Decoder

  215 Solvers

• Is it an Armstrong number?

  328 Solvers

• Sums of cubes and squares of sums

  266 Solvers

More from this Author291

• Investigate the frequency of last digits of prime numbers

  16 Solvers

• Compute the area of a lune

  7 Solvers

• Evaluate the generalized hypergeometric function

  5 Solvers

• Alert a city about a spill

  4 Solvers

• Compute the normal depth of a channel

  5 Solvers