Base | Representation |
---|---|
bin | 11101010001000100111… |
… | …110110110011010010011 |
3 | 21010021021010102110221011 |
4 | 131101010332312122103 |
5 | 230422420204133021 |
6 | 4135533343111351 |
7 | 265206314053321 |
oct | 35210476663223 |
9 | 7107233373834 |
10 | 2011202021011 |
11 | 705a45121a97 |
12 | 28594b5a2557 |
13 | 11786a2a2b81 |
14 | 6d4b250ad11 |
15 | 374b1674de1 |
hex | 1d444fb6693 |
2011202021011 has 8 divisors (see below), whose sum is σ = 2014519327920. Its totient is φ = 2007885691392.
The previous prime is 2011202020999. The next prime is 2011202021021. The reversal of 2011202021011 is 1101202021102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2011202021011 - 211 = 2011202018963 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011202020982 and 2011202021000.
It is not an unprimeable number, because it can be changed into a prime (2011202021021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3933735 + ... + 4415503.
It is an arithmetic number, because the mean of its divisors is an integer number (251814915990).
Almost surely, 22011202021011 is an apocalyptic number.
2011202021011 is a deficient number, since it is larger than the sum of its proper divisors (3317306909).
2011202021011 is an equidigital number, since it uses as much as digits as its factorization.
2011202021011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 488645.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2011202021011 its reverse (1101202021102), we get a palindrome (3112404042113).
Subtracting from 2011202021011 its reverse (1101202021102), we obtain a palindrome (909999999909).
The spelling of 2011202021011 in words is "two trillion, eleven billion, two hundred two million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •