Base | Representation |
---|---|
bin | 11101011001010010101… |
… | …100011100100001100000 |
3 | 21011010000210210110000002 |
4 | 131121102230130201200 |
5 | 231044001113341000 |
6 | 4143552454115132 |
7 | 265641012540626 |
oct | 35312254344140 |
9 | 7133023713002 |
10 | 2020022012000 |
11 | 709760844843 |
12 | 2875b134baa8 |
13 | 118644678155 |
14 | 6daaba65516 |
15 | 3782ab458d5 |
hex | 1d652b1c860 |
2020022012000 has 192 divisors, whose sum is σ = 5451568012800. Its totient is φ = 732199564800.
The previous prime is 2020022011991. The next prime is 2020022012017. The reversal of 2020022012000 is 2102200202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1170191 + ... + 2325809.
It is an arithmetic number, because the mean of its divisors is an integer number (28393583400).
Almost surely, 22020022012000 is an apocalyptic number.
2020022012000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2020022012000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2725784006400).
2020022012000 is an abundant number, since it is smaller than the sum of its proper divisors (3431546000800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2020022012000 is a wasteful number, since it uses less digits than its factorization.
2020022012000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1155686 (or 1155668 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 11.
Adding to 2020022012000 its reverse (2102200202), we get a palindrome (2022124212202).
The spelling of 2020022012000 in words is "two trillion, twenty billion, twenty-two million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •