Search a number
-
+
91115137 is a prime number
BaseRepresentation
bin1010110111001…
…00111010000001
320100110010110201
411123210322001
5141311141022
613012525201
72154315541
oct533447201
9210403421
1091115137
1147483173
1226620801
1315b526a9
14c15b321
157eec127
hex56e4e81

91115137 has 2 divisors, whose sum is σ = 91115138. Its totient is φ = 91115136.

The previous prime is 91115131. The next prime is 91115149. The reversal of 91115137 is 73151119.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 76667536 + 14447601 = 8756^2 + 3801^2 .

It is a cyclic number.

It is not a de Polignac number, because 91115137 - 27 = 91115009 is a prime.

It is not a weakly prime, because it can be changed into another prime (91115131) 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, 45557568 + 45557569.

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

Almost surely, 291115137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 945, while the sum is 28.

The square root of 91115137 is about 9545.4249250623. The cubic root of 91115137 is about 449.9837640233.

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