91000000001013 has 32 divisors (see below), whose sum is σ = 126015270374400. Its totient is φ = 58368076816896.

The previous prime is 91000000001011. The next prime is 91000000001017. The reversal of 91000000001013 is 31010000000019.

It is not a de Polignac number, because 91000000001013 - 2¹ = 91000000001011 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 91000000000983 and 91000000001001.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (91000000001011) by changing a digit.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 156311973 + ... + 156893061.

It is an arithmetic number, because the mean of its divisors is an integer number (3937977199200).

Almost surely, 2^{91000000001013} is an apocalyptic number.

It is an amenable number.

91000000001013 is a deficient number, since it is larger than the sum of its proper divisors (35015270373387).

91000000001013 is a wasteful number, since it uses less digits than its factorization.

91000000001013 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 599321.

The product of its (nonzero) digits is 27, while the sum is 15.

The spelling of 91000000001013 in words is "ninety-one trillion, one thousand, thirteen".