Base | Representation |
---|---|
bin | 100000001011001010100… |
… | …010000100101111110000 |
3 | 21211101000011111101121220 |
4 | 200023022202010233300 |
5 | 242211122321320422 |
6 | 4411420253345040 |
7 | 315511626301044 |
oct | 40131242045760 |
9 | 7741004441556 |
10 | 2211011120112 |
11 | 782759155553 |
12 | 2b8613198180 |
13 | 130660ba2522 |
14 | 790290d8024 |
15 | 3c7a7e8ae5c |
hex | 202ca884bf0 |
2211011120112 has 20 divisors (see below), whose sum is σ = 5711778727080. Its totient is φ = 737003706688.
The previous prime is 2211011120077. The next prime is 2211011120147. The reversal of 2211011120112 is 2110211101122.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2211011120077) and next prime (2211011120147).
It is a junction number, because it is equal to n+sod(n) for n = 2211011120091 and 2211011120100.
It is a congruent number.
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, 23031365787 + ... + 23031365882.
It is an arithmetic number, because the mean of its divisors is an integer number (285588936354).
Almost surely, 22211011120112 is an apocalyptic number.
It is an amenable number.
2211011120112 is an abundant number, since it is smaller than the sum of its proper divisors (3500767606968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2211011120112 is a wasteful number, since it uses less digits than its factorization.
2211011120112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46062731680 (or 46062731674 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 2211011120112 its reverse (2110211101122), we get a palindrome (4321222221234).
The spelling of 2211011120112 in words is "two trillion, two hundred eleven billion, eleven million, one hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •