Search a number
-
+
2011110110131 is a prime number
BaseRepresentation
bin11101010000111111100…
…000001111001110110011
321010021000201110220220111
4131100333200033032303
5230422223142011011
64135520301122151
7265204116611503
oct35207740171663
97107021426814
102011110110131
117059a8255a91
12285924859357
13117854232235
146d4a4223a03
15374a856c121
hex1d43f80f3b3

2011110110131 has 2 divisors, whose sum is σ = 2011110110132. Its totient is φ = 2011110110130.

The previous prime is 2011110110077. The next prime is 2011110110147. The reversal of 2011110110131 is 1310110111102.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 2011110110131 - 229 = 2010573239219 is a prime.

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

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

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

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

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

Almost surely, 22011110110131 is an apocalyptic number.

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

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

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

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

Adding to 2011110110131 its reverse (1310110111102), we get a palindrome (3321220221233).

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