Search a number
-
+
14102051 is a prime number
BaseRepresentation
bin110101110010…
…111000100011
3222112110101012
4311302320203
512102231201
61222131135
7230602565
oct65627043
928473335
1014102051
117a62097
124880aab
132bc9a12
141c31335
1513885bb
hexd72e23

14102051 has 2 divisors, whose sum is σ = 14102052. Its totient is φ = 14102050.

The previous prime is 14101963. The next prime is 14102071. The reversal of 14102051 is 15020141.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 14102051 - 214 = 14085667 is a prime.

It is a super-3 number, since 3×141020513 (a number of 22 digits) contains 333 as substring.

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

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

Almost surely, 214102051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 40, while the sum is 14.

The square root of 14102051 is about 3755.2697639451. The cubic root of 14102051 is about 241.5984221623.

Adding to 14102051 its reverse (15020141), we get a palindrome (29122192).

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