Search a number
-
+
13140302009 is a prime number
BaseRepresentation
bin11000011110011100…
…10001100010111001
31020220202210111122012
430033032101202321
5203402404131014
610011522135305
7643425503252
oct141716214271
936822714565
1013140302009
1156333a342a
1226687b1535
131315486643
148c924bb29
1551d917c3e
hex30f3918b9

13140302009 has 2 divisors, whose sum is σ = 13140302010. Its totient is φ = 13140302008.

The previous prime is 13140301973. The next prime is 13140302029. The reversal of 13140302009 is 90020304131.

13140302009 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., 9139360000 + 4000942009 = 95600^2 + 63253^2 .

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-13140302009 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 213140302009 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 13140302009 in words is "thirteen billion, one hundred forty million, three hundred two thousand, nine".