
primedivisors - number of prime divisors

Calling sequence:

primedivisors(integer)

Parameter:

integer   --  integer not equal to 0

Summary:

primedivisors returns the number of different prime numbers which divide
the integer integer not equal to zero.

primedivisors returns an error if the argument is a number but not an
integer not equal to zero. primedivisors returns the call with an evaluated
argument if the argument is not a number.  primedivisors is a kernel
function.

>>  primedivisors(11);

     1

>>  primedivisors(12);

     2

See also:  ifactor , numdivisors , phi

