Search a number
-
+
13310322311131 is a prime number
BaseRepresentation
bin1100000110110000110100…
…0010000111111111011011
31202010110021020200021220021
43001230031002013333123
53221034020002424011
644150402212411311
72542432123621426
oct301541502077733
952113236607807
1013310322311131
11427196aa4413a
1215ab768016b37
137572091b4621
1434031a02a9bd
1518137316d471
hexc1b0d087fdb

13310322311131 has 2 divisors, whose sum is σ = 13310322311132. Its totient is φ = 13310322311130.

The previous prime is 13310322311107. The next prime is 13310322311141. The reversal of 13310322311131 is 13111322301331.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 13310322311131 - 219 = 13310321786843 is a prime.

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

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

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

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

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

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

Almost surely, 213310322311131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 972, while the sum is 25.

Adding to 13310322311131 its reverse (13111322301331), we get a palindrome (26421644612462).

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