Search a number
-
+
2011113220231 is a prime number
BaseRepresentation
bin11101010000111111101…
…100000110100010000111
321010021000221022221011101
4131100333230012202013
5230422224441021411
64135520451520531
7265204155214033
oct35207754064207
97107027287141
102011113220231
117059a9a8a715
122859258b9147
13117854a80a2b
146d4a47d31c3
15374a89838c1
hex1d43fb06887

2011113220231 has 2 divisors, whose sum is σ = 2011113220232. Its totient is φ = 2011113220230.

The previous prime is 2011113220213. The next prime is 2011113220247. The reversal of 2011113220231 is 1320223111102.

Together with previous prime (2011113220213) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 2011113220231 - 215 = 2011113187463 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 22011113220231 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 144, while the sum is 19.

Adding to 2011113220231 its reverse (1320223111102), we get a palindrome (3331336331333).

The spelling of 2011113220231 in words is "two trillion, eleven billion, one hundred thirteen million, two hundred twenty thousand, two hundred thirty-one".