Base | Representation |
---|---|
bin | 1010111011110010001011… |
… | …1101111001000001100000 |
3 | 1120120022101210111121020012 |
4 | 2232330202331321001200 |
5 | 3033432431212024300 |
6 | 41322531131304052 |
7 | 2350401216600536 |
oct | 256744275710140 |
9 | 46508353447205 |
10 | 12022200111200 |
11 | 391564a5a9a44 |
12 | 1421b965ab028 |
13 | 6928c4b37666 |
14 | 2d7c40170156 |
15 | 15cad1dcb435 |
hex | aef22f79060 |
12022200111200 has 72 divisors (see below), whose sum is σ = 29352291411240. Its totient is φ = 4808372864000.
The previous prime is 12022200111151. The next prime is 12022200111269. The reversal of 12022200111200 is 211100222021.
12022200111200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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, 6843500 + ... + 8418900.
It is an arithmetic number, because the mean of its divisors is an integer number (407670714045).
Almost surely, 212022200111200 is an apocalyptic number.
12022200111200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12022200111200 is an abundant number, since it is smaller than the sum of its proper divisors (17330091300040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12022200111200 is a wasteful number, since it uses less digits than its factorization.
12022200111200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1584960 (or 1584947 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12022200111200 its reverse (211100222021), we get a palindrome (12233300333221).
The spelling of 12022200111200 in words is "twelve trillion, twenty-two billion, two hundred million, one hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •