Search a number
-
+
114015151 is a prime number
BaseRepresentation
bin1101100101110…
…11101110101111
321221112120101101
412302323232233
5213141441101
615151423531
72553053455
oct662735657
9257476341
10114015151
11593a42a8
1232224ba7
131a80cab3
14111dc9d5
15a022401
hex6cbbbaf

114015151 has 2 divisors, whose sum is σ = 114015152. Its totient is φ = 114015150.

The previous prime is 114015149. The next prime is 114015193. The reversal of 114015151 is 151510411.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 114015151 - 21 = 114015149 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2114015151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 100, while the sum is 19.

The square root of 114015151 is about 10677.7877390403. The cubic root of 114015151 is about 484.9022384172.

Adding to 114015151 its reverse (151510411), we get a palindrome (265525562).

The spelling of 114015151 in words is "one hundred fourteen million, fifteen thousand, one hundred fifty-one".