Base | Representation |
---|---|
bin | 11001011111100101101111… |
… | …111110110110111101110000 |
3 | 112200222202110221221100001112 |
4 | 121133211233332312331300 |
5 | 104144001324000323440 |
6 | 1034244045152252452 |
7 | 32421355453146341 |
oct | 3137455776667560 |
9 | 480882427840045 |
10 | 112122000011120 |
11 | 327a8744aa0050 |
12 | 106a9bb2b41128 |
13 | 4a740a019c308 |
14 | 1d98a3b5d60c8 |
15 | ce683d05b965 |
hex | 65f96ffb6f70 |
112122000011120 has 80 divisors (see below), whose sum is σ = 301110526273248. Its totient is φ = 38373304811520.
The previous prime is 112122000011117. The next prime is 112122000011149. The reversal of 112122000011120 is 21110000221211.
It is a tau number, because it is divible by the number of its divisors (80).
It is a junction number, because it is equal to n+sod(n) for n = 112122000011095 and 112122000011104.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3747378089 + ... + 3747408008.
Almost surely, 2112122000011120 is an apocalyptic number.
112122000011120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112122000011120 is an abundant number, since it is smaller than the sum of its proper divisors (188988526262128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112122000011120 is a wasteful number, since it uses less digits than its factorization.
112122000011120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7494786138 (or 7494786132 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 112122000011120 its reverse (21110000221211), we get a palindrome (133232000232331).
The spelling of 112122000011120 in words is "one hundred twelve trillion, one hundred twenty-two billion, eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •