Search a number
-
+
115009127 is a prime number
BaseRepresentation
bin1101101101011…
…10011001100111
322000102001212022
412312232121213
5213420243002
615225013355
72564363402
oct666563147
9260361768
10115009127
1159a13072
123262425b
131aa9a34c
14113bad39
15a16bba2
hex6dae667

115009127 has 2 divisors, whose sum is σ = 115009128. Its totient is φ = 115009126.

The previous prime is 115009049. The next prime is 115009183. The reversal of 115009127 is 721900511.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 115009127 - 220 = 113960551 is a prime.

It is a Chen prime.

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

It is a congruent number.

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

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

Almost surely, 2115009127 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 630, while the sum is 26.

The square root of 115009127 is about 10724.2308348897. The cubic root of 115009127 is about 486.3072777230.

Adding to 115009127 its reverse (721900511), we get a palindrome (836909638).

The spelling of 115009127 in words is "one hundred fifteen million, nine thousand, one hundred twenty-seven".