Search a number
-
+
2010201121111 is a prime number
BaseRepresentation
bin11101010000001001010…
…100101110000101010111
321010011200101001111101111
4131100021110232011113
5230413342441333421
64135250150235451
7265142441413651
oct35201124560527
97104611044344
102010201121111
11705581144097
12285710355b87
1311773ab0c201
146d4196076d1
1537453866ee1
hex1d40952e157

2010201121111 has 2 divisors, whose sum is σ = 2010201121112. Its totient is φ = 2010201121110.

The previous prime is 2010201121021. The next prime is 2010201121121. The reversal of 2010201121111 is 1111211020102.

It is a happy number.

It is a strong prime.

It is a cyclic number.

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

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (2010201121121) 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, 1005100560555 + 1005100560556.

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

Almost surely, 22010201121111 is an apocalyptic number.

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

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

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

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

Adding to 2010201121111 its reverse (1111211020102), we get a palindrome (3121412141213).

It can be divided in two parts, 2010201 and 121111, that added together give a palindrome (2131312).

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