Search a number
-
+
2010201220201 is a prime number
BaseRepresentation
bin11101010000001001010…
…101000110010001101001
321010011200101020112022111
4131100021111012101221
5230413343003021301
64135250152322321
7265142442305566
oct35201125062151
97104611215274
102010201220201
11705581201589
122857103a33a1
1311773ab45345
146d41963186d
1537453886551
hex1d409546469

2010201220201 has 2 divisors, whose sum is σ = 2010201220202. Its totient is φ = 2010201220200.

The previous prime is 2010201220189. The next prime is 2010201220213. The reversal of 2010201220201 is 1020221020102.

It is a happy number.

It is a balanced prime because it is at equal distance from previous prime (2010201220189) and next prime (2010201220213).

It can be written as a sum of positive squares in only one way, i.e., 1531779997801 + 478421222400 = 1237651^2 + 691680^2 .

It is a cyclic number.

It is not a de Polignac number, because 2010201220201 - 213 = 2010201212009 is a prime.

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

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

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

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

Almost surely, 22010201220201 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 2010201220201 its reverse (1020221020102), we get a palindrome (3030422240303).

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