You can round, floor or ceil a number like:

t.round(5.2) // 5 => BigNumber

t.floor(5.7) // 5 => BigNumber

t.ceil(5.2) // 6 => BigNumber

You can get any constants like:

t.c("pi") // 3.141592653589793 => BigNumber
t.c("e", 4) // 2.7182 => BigNumber

These are all the constants:

Constants have a precision limit of 250 digits

You can compute constants such as pi, e or the goldenRatio. Computing these value may take a lot more time.

For example, computing 1000 digits of pi took me around 19 seconds on my MacBook Pro.

In v1.2.0 you can't choose how much digits you want to compute. All constants will return a 15 digit number.

Here is how you use it:

t.pi // 3.1415926535897932408 => BigNumber

t.e // 2.71828182845904523536 => BigNumber

t.goldenRatio // 1.618033988749895 => BigNumber

You can check pretty efficiently if a number is prime or not like that:

t.isPrime(2011) // true

If your number is superior to Number.MAX_SAFE_INTEGER, it won't work

You can get the least factor (that is not 1) of any number n inferior to Number.MAX_SAFE_INTEGER like:

t.leastFactor(50) // 2 => BigNumber

You can get a list of prime factors that compose any number n less than Number.MAX_SAFE_INTEGER like that:

t.primeFactors(100) // [2, 2, 5, 5] => [BigNumber]

You can get the number of primes below any number n less than Number.MAX_SAFE_INTEGER like that:

t.primePi(100) // 25 => BigNumber

Get the nth prime like that:

t.nPrime(10) // 29 => BigNumber