Search a number
-
+
14530040501 is a prime number
BaseRepresentation
bin11011000100000111…
…01101001010110101
31101111121211112110012
431202003231022311
5214224142244001
610401445110005
71023032210054
oct154203551265
941447745405
1014530040501
116186913539
1229960b8305
1314a7381502
149bba4c39b
155a09322bb
hex3620ed2b5

14530040501 has 2 divisors, whose sum is σ = 14530040502. Its totient is φ = 14530040500.

The previous prime is 14530040479. The next prime is 14530040513. The reversal of 14530040501 is 10504003541.

14530040501 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 can be written as a sum of positive squares in only one way, i.e., 10583059876 + 3946980625 = 102874^2 + 62825^2 .

It is a cyclic number.

It is not a de Polignac number, because 14530040501 - 218 = 14529778357 is a prime.

It is a super-2 number, since 2×145300405012 (a number of 21 digits) contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 214530040501 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 14530040501 in words is "fourteen billion, five hundred thirty million, forty thousand, five hundred one".