Search a number
-
+
115016141 is a prime number
BaseRepresentation
bin1101101101100…
…00000111001101
322000102102111002
412312300013031
5213421004031
615225110045
72564423012
oct666600715
9260372432
10115016141
1159a18369
1232628325
131aaa05b6
14113bd709
15a16dccb
hex6db01cd

115016141 has 2 divisors, whose sum is σ = 115016142. Its totient is φ = 115016140.

The previous prime is 115016131. The next prime is 115016149. The reversal of 115016141 is 141610511.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 112996900 + 2019241 = 10630^2 + 1421^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-115016141 is a prime.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 2115016141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 120, while the sum is 20.

The square root of 115016141 is about 10724.5578463636. The cubic root of 115016141 is about 486.3171635759.

Adding to 115016141 its reverse (141610511), we get a palindrome (256626652).

The spelling of 115016141 in words is "one hundred fifteen million, sixteen thousand, one hundred forty-one".