Base | Representation |
---|---|
bin | 11101010001000100111… |
… | …111001100101000010100 |
3 | 21010021021010121002202212 |
4 | 131101010333030220110 |
5 | 230422420220041040 |
6 | 4135533345052552 |
7 | 265206314612543 |
oct | 35210477145024 |
9 | 7107233532685 |
10 | 2011202112020 |
11 | 705a45184402 |
12 | 28594b627158 |
13 | 11786a30541a |
14 | 6d4b253215a |
15 | 374b1691d65 |
hex | 1d444fcca14 |
2011202112020 has 48 divisors (see below), whose sum is σ = 4335642799488. Its totient is φ = 783245285760.
The previous prime is 2011202111981. The next prime is 2011202112061. The reversal of 2011202112020 is 202112021102.
It is a junction number, because it is equal to n+sod(n) for n = 2011202111986 and 2011202112004.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3492359 + ... + 4027278.
It is an arithmetic number, because the mean of its divisors is an integer number (90325891656).
Almost surely, 22011202112020 is an apocalyptic number.
2011202112020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2011202112020 is an abundant number, since it is smaller than the sum of its proper divisors (2324440687468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011202112020 is a wasteful number, since it uses less digits than its factorization.
2011202112020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7520000 (or 7519998 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2011202112020 its reverse (202112021102), we get a palindrome (2213314133122).
The spelling of 2011202112020 in words is "two trillion, eleven billion, two hundred two million, one hundred twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •