Search a number
-
+
114015113 is a prime number
BaseRepresentation
bin1101100101110…
…11101110001001
321221112120022222
412302323232021
5213141440423
615151423425
72553053402
oct662735611
9257476288
10114015113
11593a4273
1232224b75
131a80ca84
14111dc9a9
15a0223c8
hex6cbbb89

114015113 has 2 divisors, whose sum is σ = 114015114. Its totient is φ = 114015112.

The previous prime is 114015103. The next prime is 114015133. The reversal of 114015113 is 311510411.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 113379904 + 635209 = 10648^2 + 797^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 114015113 - 26 = 114015049 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

Almost surely, 2114015113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 60, while the sum is 17.

The square root of 114015113 is about 10677.7859596454. The cubic root of 114015113 is about 484.9021845463.

Adding to 114015113 its reverse (311510411), we get a palindrome (425525524).

The spelling of 114015113 in words is "one hundred fourteen million, fifteen thousand, one hundred thirteen".