Search a number
-
+
115006909 is a prime number
BaseRepresentation
bin1101101101011…
…01110110111101
322000101221211011
412312231312331
5213420210114
615224555221
72564354053
oct666556675
9260357734
10115006909
1159a11436
1232622b11
131aa99334
14113ba1d3
15a16b1c4
hex6daddbd

115006909 has 2 divisors, whose sum is σ = 115006910. Its totient is φ = 115006908.

The previous prime is 115006889. The next prime is 115006933. The reversal of 115006909 is 909600511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 77528025 + 37478884 = 8805^2 + 6122^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 115006909 - 211 = 115004861 is a prime.

It is a Chen prime.

It is equal to p6573037 and since 115006909 and 6573037 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

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

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

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

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

Almost surely, 2115006909 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2430, while the sum is 31.

The square root of 115006909 is about 10724.1274237115. The cubic root of 115006909 is about 486.3041514886.

The spelling of 115006909 in words is "one hundred fifteen million, six thousand, nine hundred nine".