Search a number
-
+
201041056610131 is a prime number
BaseRepresentation
bin101101101101100010000100…
…110000111011011101010011
3222100211100002220022101011111
4231231202010300323131103
5202322324040443011011
61551324553021354151
760226510540433413
oct5555420460733523
9870740086271144
10201041056610131
11590700403660a1
121a66b12b108957
1388241234a816a
143790620ac0643
151839814e52121
hexb6d884c3b753

201041056610131 has 2 divisors, whose sum is σ = 201041056610132. Its totient is φ = 201041056610130.

The previous prime is 201041056610129. The next prime is 201041056610189. The reversal of 201041056610131 is 131016650140102.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 201041056610131 - 21 = 201041056610129 is a prime.

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

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

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

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

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

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

Almost surely, 2201041056610131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4320, while the sum is 31.

The spelling of 201041056610131 in words is "two hundred one trillion, forty-one billion, fifty-six million, six hundred ten thousand, one hundred thirty-one".