Search a number
-
+
91115131 is a prime number
BaseRepresentation
bin1010110111001…
…00111001111011
320100110010110111
411123210321323
5141311141011
613012525151
72154315532
oct533447173
9210403414
1091115131
1147483168
12266207b7
1315b526a3
14c15b319
157eec121
hex56e4e7b

91115131 has 2 divisors, whose sum is σ = 91115132. Its totient is φ = 91115130.

The previous prime is 91115119. The next prime is 91115137. The reversal of 91115131 is 13151119.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 91115131 - 215 = 91082363 is a prime.

It is a super-2 number, since 2×911151312 = 16603934194294322, which contains 22 as substring.

It is a Chen prime.

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

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

Almost surely, 291115131 is an apocalyptic number.

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

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

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

The product of its digits is 135, while the sum is 22.

The square root of 91115131 is about 9545.4246107756. The cubic root of 91115131 is about 449.9837541460.

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