Base | Representation |
---|---|
bin | 11001010001000000110001… |
… | …010111000100001011010000 |
3 | 112120102222201022220012110101 |
4 | 121101000301113010023100 |
5 | 104031043203313341422 |
6 | 1032155531505142144 |
7 | 32256112455514615 |
oct | 3121006127041320 |
9 | 476388638805411 |
10 | 111120222012112 |
11 | 32451904478195 |
12 | 10567a1562a954 |
13 | 4a00790747871 |
14 | 1d62366da250c |
15 | cca75a685c27 |
hex | 6510315c42d0 |
111120222012112 has 20 divisors (see below), whose sum is σ = 220302300618400. Its totient is φ = 54268015400928.
The previous prime is 111120222012077. The next prime is 111120222012161. The reversal of 111120222012112 is 211210222021111.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 111120222012112.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 80755974612 + ... + 80755975987.
It is an arithmetic number, because the mean of its divisors is an integer number (11015115030920).
Almost surely, 2111120222012112 is an apocalyptic number.
It is an amenable number.
111120222012112 is a deficient number, since it is larger than the sum of its proper divisors (109182078606288).
111120222012112 is a wasteful number, since it uses less digits than its factorization.
111120222012112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161511950650 (or 161511950644 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 111120222012112 its reverse (211210222021111), we get a palindrome (322330444033223).
The spelling of 111120222012112 in words is "one hundred eleven trillion, one hundred twenty billion, two hundred twenty-two million, twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •