## `numlib::numdivisors` -- number of divisors of an integer

#### Introduction

`numlib::numdivisors``(n)` returns the number of positive divisors of `n`.

#### Call(s)

`numlib::numdivisors(n)`

#### Parameters

`n` | - | an integer

#### Returns

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

#### Related Functions

`numlib::divisors`, `numlib::numprimedivisors`, `numlib::primedivisors`

#### Details

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

#### Example 1

We compute the number of positive divisors of the number (one of the highly composite numbers studied by S. Ramanujan in 1915):

    >> numlib::numdivisors(6746328388800)

                                       10080

#### Background

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

#### Changes

- no changes

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