Search a number
-
+
13220002311013 is a prime number
BaseRepresentation
bin1100000001100000010110…
…0010101010101101100101
31201210211010200122220010201
43000120011202222231211
53213044031042423023
644041104001350501
72533053660366061
oct300300542525545
951724120586121
1013220002311013
114237631729243
121596160038431
1374b843cb1084
14339bcc830aa1
1517dd38b81bad
hexc06058aab65

13220002311013 has 2 divisors, whose sum is σ = 13220002311014. Its totient is φ = 13220002311012.

The previous prime is 13220002311011. The next prime is 13220002311017. The reversal of 13220002311013 is 31011320002231.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10460838799684 + 2759163511329 = 3234322^2 + 1661073^2 .

It is a cyclic number.

It is not a de Polignac number, because 13220002311013 - 21 = 13220002311011 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 213220002311013 is an apocalyptic number.

It is an amenable number.

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

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

13220002311013 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 216, while the sum is 19.

Adding to 13220002311013 its reverse (31011320002231), we get a palindrome (44231322313244).

The spelling of 13220002311013 in words is "thirteen trillion, two hundred twenty billion, two million, three hundred eleven thousand, thirteen".