Search a number
-
+
14310151 is a prime number
BaseRepresentation
bin110110100101…
…101100000111
3222221000211121
4312211230013
512130411101
61230414411
7232430362
oct66455407
928830747
1014310151
118094479
124961407
132c7065b
141c870d9
1513ca0a1
hexda5b07

14310151 has 2 divisors, whose sum is σ = 14310152. Its totient is φ = 14310150.

The previous prime is 14310091. The next prime is 14310167. The reversal of 14310151 is 15101341.

It is an a-pointer prime, because the next prime (14310167) can be obtained adding 14310151 to its sum of digits (16).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 14310151 - 217 = 14179079 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 214310151 is an apocalyptic number.

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

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

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

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

The square root of 14310151 is about 3782.8760222878. The cubic root of 14310151 is about 242.7810239778.

Adding to 14310151 its reverse (15101341), we get a palindrome (29411492).

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