Base | Representation |
---|---|
bin | 100000010011100010011… |
… | …000100010111101100100 |
3 | 21212020012200221021210220 |
4 | 200103202120202331210 |
5 | 242333030302211322 |
6 | 4415504322244340 |
7 | 316250461636212 |
oct | 40234230427544 |
9 | 7766180837726 |
10 | 2220001210212 |
11 | 786551898285 |
12 | 2ba301ab66b0 |
13 | 131464592c76 |
14 | 7963d08dcb2 |
15 | 3cb3235b55c |
hex | 204e2622f64 |
2220001210212 has 24 divisors (see below), whose sum is σ = 5183202376800. Its totient is φ = 739543324416.
The previous prime is 2220001210187. The next prime is 2220001210253. The reversal of 2220001210212 is 2120121000222.
It is a super-2 number, since 2×22200012102122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2220001210191 and 2220001210200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57114637 + ... + 57153492.
It is an arithmetic number, because the mean of its divisors is an integer number (215966765700).
Almost surely, 22220001210212 is an apocalyptic number.
It is an amenable number.
2220001210212 is an abundant number, since it is smaller than the sum of its proper divisors (2963201166588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2220001210212 is a wasteful number, since it uses less digits than its factorization.
2220001210212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114269755 (or 114269753 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2220001210212 its reverse (2120121000222), we get a palindrome (4340122210434).
The spelling of 2220001210212 in words is "two trillion, two hundred twenty billion, one million, two hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •