Search a number
-
+
2010200111221 is a prime number
BaseRepresentation
bin11101010000001001010…
…000110111100001110101
321010011200022011012002011
4131100021100313201311
5230413342212024341
64135250112444221
7265142430006451
oct35201120674165
97104608135064
102010200111221
11705580614375
1228570bb49671
1311773a847643
146d419423661
1537453717b81
hex1d409437875

2010200111221 has 2 divisors, whose sum is σ = 2010200111222. Its totient is φ = 2010200111220.

The previous prime is 2010200111203. The next prime is 2010200111237. The reversal of 2010200111221 is 1221110020102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2009479188721 + 720922500 = 1417561^2 + 26850^2 .

It is a cyclic number.

It is not a de Polignac number, because 2010200111221 - 211 = 2010200109173 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 22010200111221 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 16, while the sum is 13.

Adding to 2010200111221 its reverse (1221110020102), we get a palindrome (3231310131323).

The spelling of 2010200111221 in words is "two trillion, ten billion, two hundred million, one hundred eleven thousand, two hundred twenty-one".