Base | Representation |
---|---|
bin | 11001011111011011101101… |
… | …011100110011001100101000 |
3 | 112200221201122200122121212221 |
4 | 121133123231130303030220 |
5 | 104143312234322010440 |
6 | 1034235103345443424 |
7 | 32420524355411500 |
oct | 3137335534631450 |
9 | 480851580577787 |
10 | 112111220110120 |
11 | 327a4113022960 |
12 | 106a7aa4940574 |
13 | 4a73072a4847a |
14 | 1d982d7a5aa00 |
15 | ce640b996d4a |
hex | 65f6ed733328 |
112111220110120 has 192 divisors, whose sum is σ = 322942610059200. Its totient is φ = 34634519377920.
The previous prime is 112111220110117. The next prime is 112111220110177. The reversal of 112111220110120 is 21011022111211.
It is a junction number, because it is equal to n+sod(n) for n = 112111220110094 and 112111220110103.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 20572410 + ... + 25444969.
It is an arithmetic number, because the mean of its divisors is an integer number (1681992760725).
Almost surely, 2112111220110120 is an apocalyptic number.
112111220110120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112111220110120 is an abundant number, since it is smaller than the sum of its proper divisors (210831389949080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112111220110120 is a wasteful number, since it uses less digits than its factorization.
112111220110120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46017528 (or 46017517 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 112111220110120 its reverse (21011022111211), we get a palindrome (133122242221331).
The spelling of 112111220110120 in words is "one hundred twelve trillion, one hundred eleven billion, two hundred twenty million, one hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •