Search a number
-
+
131311100121161 is a prime number
BaseRepresentation
bin11101110110110100111111…
…011110100101000001001001
3122012221012220100012022122112
4131312310333132211001021
5114202400113112334121
61143135253035432105
736441625320644342
oct3566647736450111
9565835810168575
10131311100121161
11389267a7821774
1212888b798b5635
13583677826094c
14245d6c3a3b0c9
15102aa82c3875b
hex776d3f7a5049

131311100121161 has 2 divisors, whose sum is σ = 131311100121162. Its totient is φ = 131311100121160.

The previous prime is 131311100121029. The next prime is 131311100121163. The reversal of 131311100121161 is 161121001113131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 120868145940025 + 10442954181136 = 10994005^2 + 3231556^2 .

It is a cyclic number.

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

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

It is a Chen prime.

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

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

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

Almost surely, 2131311100121161 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 131311100121161 its reverse (161121001113131), we get a palindrome (292432101234292).

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