Base | Representation |
---|---|
bin | 101101101110101011100110… |
… | …010001101110101110100110 |
3 | 222101002212212202000012210011 |
4 | 231232223212101232232212 |
5 | 202330122231003310042 |
6 | 1551425130423320434 |
7 | 60235304065320214 |
oct | 5556534621565646 |
9 | 871085782005704 |
10 | 201120002010022 |
11 | 590a0571a46537 |
12 | 1a6824a18b011a |
13 | 882b6c4c96934 |
14 | 379438d777cb4 |
15 | 183b8d5a56a17 |
hex | b6eae646eba6 |
201120002010022 has 8 divisors (see below), whose sum is σ = 301680102937896. Its totient is φ = 100559967697392.
The previous prime is 201120002010007. The next prime is 201120002010023. The reversal of 201120002010022 is 220010200021102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2011200020100222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201120002009984 and 201120002010011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201120002010023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8259828 + ... + 21690199.
It is an arithmetic number, because the mean of its divisors is an integer number (37710012867237).
Almost surely, 2201120002010022 is an apocalyptic number.
201120002010022 is a deficient number, since it is larger than the sum of its proper divisors (100560100927874).
201120002010022 is a wasteful number, since it uses less digits than its factorization.
201120002010022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33307622.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 201120002010022 its reverse (220010200021102), we get a palindrome (421130202031124).
The spelling of 201120002010022 in words is "two hundred one trillion, one hundred twenty billion, two million, ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •