## `numlib::numprimedivisors` -- number of prime factors of an integer

#### Introduction

`numlib::numprimedivisors``(n)` returns the number of prime factors of the integer `n`, counted without multiplicity.

#### Call(s)

`numlib::numprimedivisors(n)`

#### Parameters

`n` | - | an integer

#### Returns

`numlib::numprimedivisors``(n)` returns a nonnegative integer.

#### Related Functions

`numlib::primedivisors`, `numlib::numdivisors`

#### Details

- `numlib::numprimedivisors``(0)` returns `0`.
- `numlib::numprimedivisors` returns the function call with evaluated argument if the argument is not a number.
- `numlib::numprimedivisors` returns an error if the argument evaluates to a number of wrong type.

#### Example 1

We compute the number of primes dividing :

    >> numlib::numprimedivisors(6746328388800)

                                         9

#### Background

- Internally, `ifactor` is used for factoring `n`.

#### Changes

- no changes

Do you have questions or comments?
Copyright © SciFace Software GmbH & Co. KG 2000