Base | Representation |
---|---|
bin | 1011000000111101101111… |
… | …0010010010110110000000 |
3 | 1120212211010100212122221121 |
4 | 2300033123302102312000 |
5 | 3041412214222431422 |
6 | 41431450352202024 |
7 | 2360001555102334 |
oct | 260173362226600 |
9 | 46784110778847 |
10 | 12111200202112 |
11 | 394a370859590 |
12 | 1437294539314 |
13 | 69b109751c4b |
14 | 2dc2843457c4 |
15 | 1600905938c7 |
hex | b03dbc92d80 |
12111200202112 has 64 divisors (see below), whose sum is σ = 26345083023360. Its totient is φ = 5500099279360.
The previous prime is 12111200202109. The next prime is 12111200202137. The reversal of 12111200202112 is 21120200211121.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2346208 + ... + 5452255.
It is an arithmetic number, because the mean of its divisors is an integer number (411641922240).
Almost surely, 212111200202112 is an apocalyptic number.
It is an amenable number.
12111200202112 is an abundant number, since it is smaller than the sum of its proper divisors (14233882821248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12111200202112 is a wasteful number, since it uses less digits than its factorization.
12111200202112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7799591 (or 7799579 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 12111200202112 its reverse (21120200211121), we get a palindrome (33231400413233).
Subtracting 12111200202112 from its reverse (21120200211121), we obtain a palindrome (9009000009009).
The spelling of 12111200202112 in words is "twelve trillion, one hundred eleven billion, two hundred million, two hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •