Base | Representation |
---|---|
bin | 11101011001010010000… |
… | …111000001000001001011 |
3 | 21011010000010022221111002 |
4 | 131121102013001001023 |
5 | 231043441110400021 |
6 | 4143551503525215 |
7 | 265640533253351 |
oct | 35312207010113 |
9 | 7133003287432 |
10 | 2020012200011 |
11 | 709756252963 |
12 | 2875a9bb980b |
13 | 118642621040 |
14 | 6daaa62d7d1 |
15 | 37829d5850b |
hex | 1d6521c104b |
2020012200011 has 8 divisors (see below), whose sum is σ = 2178080129904. Its totient is φ = 1862327466720.
The previous prime is 2020012199983. The next prime is 2020012200043. The reversal of 2020012200011 is 1100022100202.
It is a happy number.
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 2020012200011 - 234 = 2002832330827 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2020012199965 and 2020012200001.
It is not an unprimeable number, because it can be changed into a prime (2020012200911) 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 7 ways as a sum of consecutive naturals, for example, 95788196 + ... + 95809281.
It is an arithmetic number, because the mean of its divisors is an integer number (272260016238).
Almost surely, 22020012200011 is an apocalyptic number.
2020012200011 is a deficient number, since it is larger than the sum of its proper divisors (158067929893).
2020012200011 is a wasteful number, since it uses less digits than its factorization.
2020012200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191598301.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2020012200011 its reverse (1100022100202), we get a palindrome (3120034300213).
The spelling of 2020012200011 in words is "two trillion, twenty billion, twelve million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •