Search a number
-
+
14656501 is a prime number
BaseRepresentation
bin110111111010…
…001111110101
31000120121221101
4313322033311
512223002001
61242050101
7235402216
oct67721765
930517841
1014656501
118300712
124aa9931
1330621b2
141d3740d
151447a01
hexdfa3f5

14656501 has 2 divisors, whose sum is σ = 14656502. Its totient is φ = 14656500.

The previous prime is 14656463. The next prime is 14656511. The reversal of 14656501 is 10565641.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 14638276 + 18225 = 3826^2 + 135^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 14656501 - 219 = 14132213 is a prime.

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 14656501.

It is a congruent number.

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

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

Almost surely, 214656501 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3600, while the sum is 28.

The square root of 14656501 is about 3828.3809894001. The cubic root of 14656501 is about 244.7241153877.

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