Base | Representation |
---|---|
bin | 11101010001000000001… |
… | …101100110100100100011 |
3 | 21010021001112212002202220 |
4 | 131101000031212210203 |
5 | 230422234213032321 |
6 | 4135521404042123 |
7 | 265204322651340 |
oct | 35210015464443 |
9 | 7107045762686 |
10 | 2011122002211 |
11 | 705a03a38753 |
12 | 285928833343 |
13 | 11785683707a |
14 | 6d4a5a3b7c7 |
15 | 374a961a9c6 |
hex | 1d440366923 |
2011122002211 has 64 divisors (see below), whose sum is σ = 3223207987200. Its totient is φ = 1091057587200.
The previous prime is 2011122002209. The next prime is 2011122002221. The reversal of 2011122002211 is 1122002211102.
It is not a de Polignac number, because 2011122002211 - 21 = 2011122002209 is a prime.
It is a super-2 number, since 2×20111220022112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2011122002221) 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 in 63 ways as a sum of consecutive naturals, for example, 163115095 + ... + 163127423.
It is an arithmetic number, because the mean of its divisors is an integer number (50362624800).
Almost surely, 22011122002211 is an apocalyptic number.
2011122002211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2011122002211 is a deficient number, since it is larger than the sum of its proper divisors (1212085984989).
2011122002211 is a wasteful number, since it uses less digits than its factorization.
2011122002211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16820.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2011122002211 its reverse (1122002211102), we get a palindrome (3133124213313).
The spelling of 2011122002211 in words is "two trillion, eleven billion, one hundred twenty-two million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •