Search a number
-
+
14311151 is a prime number
BaseRepresentation
bin110110100101…
…111011101111
3222221002012122
4312211323233
512130424101
61230423155
7232433321
oct66457357
928832178
1014311151
1180951a8
124961abb
132c70c4a
141c87611
1513ca51b
hexda5eef

14311151 has 2 divisors, whose sum is σ = 14311152. Its totient is φ = 14311150.

The previous prime is 14311117. The next prime is 14311159. The reversal of 14311151 is 15111341.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-14311151 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 (14311159) 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, 7155575 + 7155576.

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

Almost surely, 214311151 is an apocalyptic number.

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

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

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

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

The square root of 14311151 is about 3783.0081945457. The cubic root of 14311151 is about 242.7866790629.

Adding to 14311151 its reverse (15111341), we get a palindrome (29422492).

The spelling of 14311151 in words is "fourteen million, three hundred eleven thousand, one hundred fifty-one".