Base | Representation |
---|---|
bin | 11101010001000000001… |
… | …101100110100001011011 |
3 | 21010021001112212002111111 |
4 | 131101000031212201123 |
5 | 230422234213031021 |
6 | 4135521404041151 |
7 | 265204322650633 |
oct | 35210015464133 |
9 | 7107045762444 |
10 | 2011122002011 |
11 | 705a03a38591 |
12 | 2859288331b7 |
13 | 117856836c55 |
14 | 6d4a5a3b6c3 |
15 | 374a961a8e1 |
hex | 1d44036685b |
2011122002011 has 4 divisors (see below), whose sum is σ = 2065476650752. Its totient is φ = 1956767353272.
The previous prime is 2011122001969. The next prime is 2011122002077. The reversal of 2011122002011 is 1102002211102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2011122002011 - 219 = 2011121477723 is a prime.
It is a super-2 number, since 2×20111220020112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011122001982 and 2011122002000.
It is not an unprimeable number, because it can be changed into a prime (2011122002111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27177324315 + ... + 27177324388.
It is an arithmetic number, because the mean of its divisors is an integer number (516369162688).
Almost surely, 22011122002011 is an apocalyptic number.
2011122002011 is a deficient number, since it is larger than the sum of its proper divisors (54354648741).
2011122002011 is an equidigital number, since it uses as much as digits as its factorization.
2011122002011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54354648740.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2011122002011 its reverse (1102002211102), we get a palindrome (3113124213113).
The spelling of 2011122002011 in words is "two trillion, eleven billion, one hundred twenty-two million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •