Base | Representation |
---|---|
bin | 100000000001000000110… |
… | …101110101111110111000 |
3 | 21210022212112012121122012 |
4 | 200001000311311332320 |
5 | 242021311421041440 |
6 | 4402414520345052 |
7 | 314644542615065 |
oct | 40010065657670 |
9 | 7708775177565 |
10 | 2200111112120 |
11 | 779075403189 |
12 | 2b6490915188 |
13 | 12c6148b7b5c |
14 | 786b3615c6c |
15 | 3c36b09de65 |
hex | 20040d75fb8 |
2200111112120 has 32 divisors (see below), whose sum is σ = 4950586555200. Its totient is φ = 879984613248.
The previous prime is 2200111112119. The next prime is 2200111112123. The reversal of 2200111112120 is 212111110022.
It is a junction number, because it is equal to n+sod(n) for n = 2200111112095 and 2200111112104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200111112123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1271675 + ... + 2453034.
It is an arithmetic number, because the mean of its divisors is an integer number (154705829850).
Almost surely, 22200111112120 is an apocalyptic number.
2200111112120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2200111112120 is an abundant number, since it is smaller than the sum of its proper divisors (2750475443080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2200111112120 is a wasteful number, since it uses less digits than its factorization.
2200111112120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3739487 (or 3739483 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2200111112120 its reverse (212111110022), we get a palindrome (2412222222142).
The spelling of 2200111112120 in words is "two trillion, two hundred billion, one hundred eleven million, one hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •