Base | Representation |
---|---|
bin | 11001100000101110100101… |
… | …001100100101001100000110 |
3 | 112201021020100000011202102200 |
4 | 121200232211030211030012 |
5 | 104201242003231241402 |
6 | 1034344021125015330 |
7 | 32430124414661364 |
oct | 3140564514451406 |
9 | 481236300152380 |
10 | 112200202212102 |
11 | 32828925106114 |
12 | 10701198854546 |
13 | 4a7b583a04b14 |
14 | 1d9c7396ac634 |
15 | ce88b87a921c |
hex | 660ba5325306 |
112200202212102 has 24 divisors (see below), whose sum is σ = 247220784537480. Its totient is φ = 36766167956160.
The previous prime is 112200202212097. The next prime is 112200202212149. The reversal of 112200202212102 is 201212202002211.
It is a happy number.
112200202212102 is a `hidden beast` number, since 1 + 12 + 200 + 20 + 221 + 210 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 52824952899 + ... + 52824955022.
It is an arithmetic number, because the mean of its divisors is an integer number (10300866022395).
Almost surely, 2112200202212102 is an apocalyptic number.
112200202212102 is an abundant number, since it is smaller than the sum of its proper divisors (135020582325378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112200202212102 is a wasteful number, since it uses less digits than its factorization.
112200202212102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105649907988 (or 105649907985 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 112200202212102 its reverse (201212202002211), we get a palindrome (313412404214313).
The spelling of 112200202212102 in words is "one hundred twelve trillion, two hundred billion, two hundred two million, two hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •