Base | Representation |
---|---|
bin | 110010000100011111011111… |
… | …000101100001111101011001 |
3 | 1001212200222002222112010010220 |
4 | 302010133133011201331121 |
5 | 212330414122304032301 |
6 | 2100203313013430253 |
7 | 64245502065301602 |
oct | 6204373705417531 |
9 | 1055628088463126 |
10 | 220211011002201 |
11 | 64190a689044aa |
12 | 2084645203b389 |
13 | 95b4a69b6c1ab |
14 | 3c543ac498da9 |
15 | 1a6d2d8dad936 |
hex | c847df161f59 |
220211011002201 has 8 divisors (see below), whose sum is σ = 303086122669824. Its totient is φ = 142071620001360.
The previous prime is 220211011002161. The next prime is 220211011002221. The reversal of 220211011002201 is 102200110112022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220211011002201 - 29 = 220211011001689 is a prime.
It is a super-2 number, since 2×2202110110022012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (220211011002221) 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, 1183930166586 + ... + 1183930166771.
It is an arithmetic number, because the mean of its divisors is an integer number (37885765333728).
Almost surely, 2220211011002201 is an apocalyptic number.
It is an amenable number.
220211011002201 is a deficient number, since it is larger than the sum of its proper divisors (82875111667623).
220211011002201 is a wasteful number, since it uses less digits than its factorization.
220211011002201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2367860333391.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 220211011002201 its reverse (102200110112022), we get a palindrome (322411121114223).
The spelling of 220211011002201 in words is "two hundred twenty trillion, two hundred eleven billion, eleven million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •