Base | Representation |
---|---|
bin | 11001100000101110100101… |
… | …001100100101001100000100 |
3 | 112201021020100000011202102121 |
4 | 121200232211030211030010 |
5 | 104201242003231241400 |
6 | 1034344021125015324 |
7 | 32430124414661362 |
oct | 3140564514451404 |
9 | 481236300152377 |
10 | 112200202212100 |
11 | 32828925106112 |
12 | 10701198854544 |
13 | 4a7b583a04b12 |
14 | 1d9c7396ac632 |
15 | ce88b87a921a |
hex | 660ba5325304 |
112200202212100 has 72 divisors (see below), whose sum is σ = 245182882985600. Its totient is φ = 44566194556800.
The previous prime is 112200202212097. The next prime is 112200202212149. The reversal of 112200202212100 is 1212202002211.
It is a happy number.
It is a super-2 number, since 2×1122002022121002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2215285 + ... + 15142915.
Almost surely, 2112200202212100 is an apocalyptic number.
112200202212100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112200202212100 is an abundant number, since it is smaller than the sum of its proper divisors (132982680773500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112200202212100 is a wasteful number, since it uses less digits than its factorization.
112200202212100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12928253 (or 12928246 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 112200202212100 its reverse (1212202002211), we get a palindrome (113412404214311).
The spelling of 112200202212100 in words is "one hundred twelve trillion, two hundred billion, two hundred two million, two hundred twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •