Search a number
-
+
14510147 is a prime number
BaseRepresentation
bin110111010110…
…100001000011
31000022012011212
4313112201003
512203311042
61235000335
7234222431
oct67264103
930265155
1014510147
118210763
124a390ab
1330106b2
141cd9d51
151419482
hexdd6843

14510147 has 2 divisors, whose sum is σ = 14510148. Its totient is φ = 14510146.

The previous prime is 14510113. The next prime is 14510159. The reversal of 14510147 is 74101541.

It is a happy number.

14510147 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 14510147 - 210 = 14509123 is a prime.

It is a Chen prime.

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

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

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

Almost surely, 214510147 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 560, while the sum is 23.

The square root of 14510147 is about 3809.2186862925. The cubic root of 14510147 is about 243.9068162944.

Adding to 14510147 its reverse (74101541), we get a palindrome (88611688).

The spelling of 14510147 in words is "fourteen million, five hundred ten thousand, one hundred forty-seven".