Search a number
-
+
13321023202913 is a prime number
BaseRepresentation
bin1100000111011000101011…
…0110110010011001100001
31202011110220000021220210112
43001312022312302121201
53221222423414443123
644155332113541105
72543261241660566
oct301661266623141
952143800256715
1013321023202913
114276461357558
1215b1853874795
1375822316405a
14340a532ba86d
1518179c827d78
hexc1d8adb2661

13321023202913 has 2 divisors, whose sum is σ = 13321023202914. Its totient is φ = 13321023202912.

The previous prime is 13321023202891. The next prime is 13321023203027. The reversal of 13321023202913 is 31920232012331.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7500302414224 + 5820720788689 = 2738668^2 + 2412617^2 .

It is a cyclic number.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

Almost surely, 213321023202913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11664, while the sum is 32.

The spelling of 13321023202913 in words is "thirteen trillion, three hundred twenty-one billion, twenty-three million, two hundred two thousand, nine hundred thirteen".