Search a number
-
+
13310101211039 is a prime number
BaseRepresentation
bin1100000110101111111111…
…0110101100011110011111
31202010102200211122020120222
43001223333312230132133
53221033041402223124
644150324233431555
72542423500403643
oct301537766543637
952112624566528
1013310101211039
11427186715a396
1215ab705b6b5bb
137571a2450279
143402d8914c23
1518135da4725e
hexc1affdac79f

13310101211039 has 2 divisors, whose sum is σ = 13310101211040. Its totient is φ = 13310101211038.

The previous prime is 13310101211027. The next prime is 13310101211047. The reversal of 13310101211039 is 93011210101331.

It is a strong prime.

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

It is a cyclic number.

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

It is a junction number, because it is equal to n+sod(n) for n = 13310101210999 and 13310101211017.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

Almost surely, 213310101211039 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 26.

The spelling of 13310101211039 in words is "thirteen trillion, three hundred ten billion, one hundred one million, two hundred eleven thousand, thirty-nine".