Base | Representation |
---|---|
bin | 11101000111101011011… |
… | …101101100010110001101 |
3 | 21002022012210220222112121 |
4 | 131013223131230112031 |
5 | 230241233204102341 |
6 | 4131144120532541 |
7 | 264401243144365 |
oct | 35075335542615 |
9 | 7068183828477 |
10 | 2001110222221 |
11 | 701736608210 |
12 | 2839b3921151 |
13 | 11691c583ab6 |
14 | 6cbd60cd9a5 |
15 | 370c06d24d1 |
hex | 1d1eb76c58d |
2001110222221 has 8 divisors (see below), whose sum is σ = 2311442823744. Its totient is φ = 1712179869120.
The previous prime is 2001110222143. The next prime is 2001110222303. The reversal of 2001110222221 is 1222220111002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2001110222221 - 221 = 2001108125069 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2001110222195 and 2001110222204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001110222621) 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, 5350561905 + ... + 5350562278.
It is an arithmetic number, because the mean of its divisors is an integer number (288930352968).
Almost surely, 22001110222221 is an apocalyptic number.
It is an amenable number.
2001110222221 is a deficient number, since it is larger than the sum of its proper divisors (310332601523).
2001110222221 is a wasteful number, since it uses less digits than its factorization.
2001110222221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10701124211.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 2001110222221 its reverse (1222220111002), we get a palindrome (3223330333223).
The spelling of 2001110222221 in words is "two trillion, one billion, one hundred ten million, two hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •