Search a number
-
+
114905591 is a prime number
BaseRepresentation
bin1101101100101…
…01000111110111
322000012210211122
412312111013313
5213403434331
615222454155
72563452503
oct666250767
9260183748
10114905591
11599522a9
123259435b
131aa62198
1411391303
15a14b17b
hex6d951f7

114905591 has 2 divisors, whose sum is σ = 114905592. Its totient is φ = 114905590.

The previous prime is 114905587. The next prime is 114905611. The reversal of 114905591 is 195509411.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 114905591 - 22 = 114905587 is a prime.

It is a congruent number.

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

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

Almost surely, 2114905591 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 8100, while the sum is 35.

The square root of 114905591 is about 10719.4025486498. The cubic root of 114905591 is about 486.1613025634.

The spelling of 114905591 in words is "one hundred fourteen million, nine hundred five thousand, five hundred ninety-one".