Search a number
-
+
131311101320033 is a prime number
BaseRepresentation
bin11101110110110100111111…
…100011001001101101100001
3122012221012220102110020012012
4131312310333203021231201
5114202400113414220113
61143135253121242305
736441625334066525
oct3566647743115541
9565835812406165
10131311101320033
11389267a8470478
1212888b7a193395
13583677859053b
14245d6c3c6dd85
15102aa82dc3aa8
hex776d3f8c9b61

131311101320033 has 2 divisors, whose sum is σ = 131311101320034. Its totient is φ = 131311101320032.

The previous prime is 131311101320011. The next prime is 131311101320039. The reversal of 131311101320033 is 330023101113131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 123733320108304 + 7577781211729 = 11123548^2 + 2752777^2 .

It is a cyclic number.

It is not a de Polignac number, because 131311101320033 - 26 = 131311101319969 is a prime.

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

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

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

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

Almost surely, 2131311101320033 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 131311101320033 its reverse (330023101113131), we get a palindrome (461334202433164).

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