91527041 has 2 divisors, whose sum is σ = 91527042. Its totient is φ = 91527040.

The previous prime is 91527019. The next prime is 91527053. The reversal of 91527041 is 14072519.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 50822641 + 40704400 = 7129^2 + 6380^2 .

It is an emirp because it is prime and its reverse (14072519) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-91527041 is a prime.

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

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

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

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

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

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

Almost surely, 2^91527041 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2520, while the sum is 29.

The square root of 91527041 is about 9566.9765861530. The cubic root of 91527041 is about 450.6608249883.

The spelling of 91527041 in words is "ninety-one million, five hundred twenty-seven thousand, forty-one".