Base | Representation |
---|---|
bin | 100000000010110111111… |
… | …111000010011101010101 |
3 | 21210112000211111012201020 |
4 | 200002313333002131111 |
5 | 242034410130324341 |
6 | 4403345123551353 |
7 | 315045224153211 |
oct | 40026777023525 |
9 | 7715024435636 |
10 | 2202110011221 |
11 | 779a0076870a |
12 | 2b694a22b559 |
13 | 12c872a680a3 |
14 | 78822ca5941 |
15 | 3c4367e5566 |
hex | 200b7fc2755 |
2202110011221 has 32 divisors (see below), whose sum is σ = 3112328613888. Its totient is φ = 1380175829760.
The previous prime is 2202110011207. The next prime is 2202110011229. The reversal of 2202110011221 is 1221100112022.
2202110011221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2202110011221 - 213 = 2202110003029 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2202110011221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2202110011229) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 371535760 + ... + 371541686.
It is an arithmetic number, because the mean of its divisors is an integer number (97260269184).
Almost surely, 22202110011221 is an apocalyptic number.
It is an amenable number.
2202110011221 is a deficient number, since it is larger than the sum of its proper divisors (910218602667).
2202110011221 is a wasteful number, since it uses less digits than its factorization.
2202110011221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12841.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2202110011221 its reverse (1221100112022), we get a palindrome (3423210123243).
The spelling of 2202110011221 in words is "two trillion, two hundred two billion, one hundred ten million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •