Base | Representation |
---|---|
bin | 11001011101110110000000… |
… | …001000111111110110011000 |
3 | 112200120021202210100211210212 |
4 | 121131312000020333312120 |
5 | 104140020110034120440 |
6 | 1034113003005230252 |
7 | 32406610161101525 |
oct | 3135660010776630 |
9 | 480507683324725 |
10 | 112002012020120 |
11 | 32761871998522 |
12 | 1068a8a7262388 |
13 | 4a6598a62b081 |
14 | 1d92cd7ad814c |
15 | ce3669179465 |
hex | 65dd8023fd98 |
112002012020120 has 128 divisors (see below), whose sum is σ = 255804717168000. Its totient is φ = 44130185994240.
The previous prime is 112002012020023. The next prime is 112002012020149. The reversal of 112002012020120 is 21020210200211.
It is a junction number, because it is equal to n+sod(n) for n = 112002012020095 and 112002012020104.
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, 2614465661 + ... + 2614508499.
It is an arithmetic number, because the mean of its divisors is an integer number (1998474352875).
Almost surely, 2112002012020120 is an apocalyptic number.
112002012020120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112002012020120 is an abundant number, since it is smaller than the sum of its proper divisors (143802705147880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112002012020120 is a wasteful number, since it uses less digits than its factorization.
112002012020120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46453 (or 46449 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 112002012020120 its reverse (21020210200211), we get a palindrome (133022222220331).
The spelling of 112002012020120 in words is "one hundred twelve trillion, two billion, twelve million, twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •