Search a number
-
+
201111201021961 is a prime number
BaseRepresentation
bin101101101110100011011001…
…101100101000000000001001
3222101002001011101101200211101
4231232203121230220000021
5202330001214430200321
61551421113231501401
760234543020206666
oct5556433154500011
9871061141350741
10201111201021961
115909786602298a
121a680846387861
13882a921815ca9
143793b96968a6d
15183b56d08b791
hexb6e8d9b28009

201111201021961 has 2 divisors, whose sum is σ = 201111201021962. Its totient is φ = 201111201021960.

The previous prime is 201111201021889. The next prime is 201111201022013. The reversal of 201111201021961 is 169120102111102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 199017493310736 + 2093707711225 = 14107356^2 + 1446965^2 .

It is a cyclic number.

It is not a de Polignac number, because 201111201021961 - 223 = 201111192633353 is a prime.

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

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

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

Almost surely, 2201111201021961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 432, while the sum is 28.

The spelling of 201111201021961 in words is "two hundred one trillion, one hundred eleven billion, two hundred one million, twenty-one thousand, nine hundred sixty-one".