Search a number
-
+
201120012221201 is a prime number
BaseRepresentation
bin101101101110101011100110…
…111000101011101100010001
3222101002212220110012222212222
4231232223212320223230101
5202330122241112034301
61551425131430230425
760235304251156343
oct5556534670535421
9871085813188788
10201120012221201
11590a0577790327
121a6824a51b5415
13882b6c7130658
143794390c75293
15183b8d68c231b
hexb6eae6e2bb11

201120012221201 has 2 divisors, whose sum is σ = 201120012221202. Its totient is φ = 201120012221200.

The previous prime is 201120012221173. The next prime is 201120012221207. The reversal of 201120012221201 is 102122210021102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 169927519140625 + 31192493080576 = 13035625^2 + 5585024^2 .

It is a cyclic number.

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

It is a self number, because there is not a number n which added to its sum of digits gives 201120012221201.

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

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

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

Almost surely, 2201120012221201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 64, while the sum is 17.

Adding to 201120012221201 its reverse (102122210021102), we get a palindrome (303242222242303).

The spelling of 201120012221201 in words is "two hundred one trillion, one hundred twenty billion, twelve million, two hundred twenty-one thousand, two hundred one".