Base | Representation |
---|---|
bin | 1001001001010101101101… |
… | …01101010001001011010110 |
3 | 2122012200211222112022022220 |
4 | 10210222312231101023112 |
5 | 10114004041130400042 |
6 | 110435212221203210 |
7 | 4144023433011240 |
oct | 444526655211326 |
9 | 78180758468286 |
10 | 20112102200022 |
11 | 6454549409138 |
12 | 2309a3a400506 |
13 | b2b74218bc81 |
14 | 4d7606701090 |
15 | 24d2667cc8ec |
hex | 124ab6b512d6 |
20112102200022 has 128 divisors (see below), whose sum is σ = 50394614400000. Its totient is φ = 5220880261632.
The previous prime is 20112102199957. The next prime is 20112102200039. The reversal of 20112102200022 is 22000220121102.
It is a junction number, because it is equal to n+sod(n) for n = 20112102199974 and 20112102200010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 531804 + ... + 6364512.
It is an arithmetic number, because the mean of its divisors is an integer number (393707925000).
Almost surely, 220112102200022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20112102200022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25197307200000).
20112102200022 is an abundant number, since it is smaller than the sum of its proper divisors (30282512199978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20112102200022 is a wasteful number, since it uses less digits than its factorization.
20112102200022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5832918.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 20112102200022 its reverse (22000220121102), we get a palindrome (42112322321124).
The spelling of 20112102200022 in words is "twenty trillion, one hundred twelve billion, one hundred two million, two hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •