Base | Representation |
---|---|
bin | 1001000110101010010111… |
… | …00111011111101001101000 |
3 | 2121212220101222020212212120 |
4 | 10203111023213133221220 |
5 | 10111002141432223422 |
6 | 110325040115111240 |
7 | 4134256006343265 |
oct | 443251347375150 |
9 | 77786358225776 |
10 | 20020111211112 |
11 | 6419532945671 |
12 | 22b40468a2520 |
13 | b22b71a2905c |
14 | 4d2d9b21226c |
15 | 24ab8076d45c |
hex | 12354b9dfa68 |
20020111211112 has 16 divisors (see below), whose sum is σ = 50050278027840. Its totient is φ = 6673370403696.
The previous prime is 20020111211099. The next prime is 20020111211129. The reversal of 20020111211112 is 21111211102002.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 20020111211091 and 20020111211100.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 417085650208 + ... + 417085650255.
It is an arithmetic number, because the mean of its divisors is an integer number (3128142376740).
Almost surely, 220020111211112 is an apocalyptic number.
It is an amenable number.
20020111211112 is an abundant number, since it is smaller than the sum of its proper divisors (30030166816728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20020111211112 is a wasteful number, since it uses less digits than its factorization.
20020111211112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 834171300472 (or 834171300468 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 20020111211112 its reverse (21111211102002), we get a palindrome (41131322313114).
It can be divided in two parts, 2002011 and 1211112, that added together give a palindrome (3213123).
The spelling of 20020111211112 in words is "twenty trillion, twenty billion, one hundred eleven million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •