91015147 has 2 divisors, whose sum is σ = 91015148. Its totient is φ = 91015146.

The previous prime is 91015091. The next prime is 91015157. The reversal of 91015147 is 74151019.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 91015147 - 2⁷ = 91015019 is a prime.

It is not a weakly prime, because it can be changed into another prime (91015157) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 45507573 + 45507574.

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

Almost surely, 2^91015147 is an apocalyptic number.

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

91015147 is an equidigital number, since it uses as much as digits as its factorization.

91015147 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 1260, while the sum is 28.

The square root of 91015147 is about 9540.1858996563. The cubic root of 91015147 is about 449.8190993038.

The spelling of 91015147 in words is "ninety-one million, fifteen thousand, one hundred forty-seven".