Search a number
-
+
131001112020413 is a prime number
BaseRepresentation
bin11101110010010100010010…
…101111110100010110111101
3122011211120202201220012111002
4131302110102233310112331
5114132310234134123123
61142341025142540045
736410342451366515
oct3562242257642675
9564746681805432
10131001112020413
11388172945a8558
1212838a87437625
13581347604ca6b
14244c6b8192845
15102298d76c528
hex772512bf45bd

131001112020413 has 2 divisors, whose sum is σ = 131001112020414. Its totient is φ = 131001112020412.

The previous prime is 131001112020379. The next prime is 131001112020479. The reversal of 131001112020413 is 314020211100131.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 98674461984004 + 32326650036409 = 9933502^2 + 5685653^2 .

It is a cyclic number.

It is not a de Polignac number, because 131001112020413 - 244 = 113408925975997 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2131001112020413 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 144, while the sum is 20.

Adding to 131001112020413 its reverse (314020211100131), we get a palindrome (445021323120544).

The spelling of 131001112020413 in words is "one hundred thirty-one trillion, one billion, one hundred twelve million, twenty thousand, four hundred thirteen".