Search a number
-
+
115005377 is a prime number
BaseRepresentation
bin1101101101011…
…01011111000001
322000101212201102
412312231133001
5213420133002
615224544145
72564346434
oct666553701
9260355642
10115005377
1159a10273
1232622055
131aa98726
14113b981b
15a16aa02
hex6dad7c1

115005377 has 2 divisors, whose sum is σ = 115005378. Its totient is φ = 115005376.

The previous prime is 115005311. The next prime is 115005379. The reversal of 115005377 is 773500511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 114939841 + 65536 = 10721^2 + 256^2 .

It is a cyclic number.

It is not a de Polignac number, because 115005377 - 210 = 115004353 is a prime.

Together with 115005379, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 2115005377 is an apocalyptic number.

It is an amenable number.

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

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

115005377 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 3675, while the sum is 29.

The square root of 115005377 is about 10724.0559957509. The cubic root of 115005377 is about 486.3019921364.

Adding to 115005377 its reverse (773500511), we get a palindrome (888505888).

The spelling of 115005377 in words is "one hundred fifteen million, five thousand, three hundred seventy-seven".