Search a number
-
+
14509151 is a prime number
BaseRepresentation
bin110111010110…
…010001011111
31000022010210222
4313112101133
512203243101
61234551555
7234216506
oct67262137
930263728
1014509151
11820aa38
124a385bb
1330100c7
141cd983d
15141901b
hexdd645f

14509151 has 2 divisors, whose sum is σ = 14509152. Its totient is φ = 14509150.

The previous prime is 14509133. The next prime is 14509153. The reversal of 14509151 is 15190541.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 14509151 - 210 = 14508127 is a prime.

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

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 14509151.

It is a congruent number.

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

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

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

Almost surely, 214509151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 900, while the sum is 26.

The square root of 14509151 is about 3809.0879485777. The cubic root of 14509151 is about 243.9012354470.

Adding to 14509151 its reverse (15190541), we get a palindrome (29699692).

It can be divided in two parts, 1450 and 9151, that added together give a palindrome (10601).

The spelling of 14509151 in words is "fourteen million, five hundred nine thousand, one hundred fifty-one".