Base | Representation |
---|---|
bin | 110010000100010101001110… |
… | …110110001000100000111001 |
3 | 1001212122220200200110202021020 |
4 | 302010111032312020200321 |
5 | 212330224100241041441 |
6 | 2100154252313333053 |
7 | 64244632205624652 |
oct | 6204251666104071 |
9 | 1055586620422236 |
10 | 220200001112121 |
11 | 64187329031098 |
12 | 2084429aa07189 |
13 | 95b3a03b91034 |
14 | 3c53a46172529 |
15 | 1a6cd92518e66 |
hex | c8454ed88839 |
220200001112121 has 8 divisors (see below), whose sum is σ = 293618313778080. Its totient is φ = 146790844593792.
The previous prime is 220200001112099. The next prime is 220200001112123. The reversal of 220200001112121 is 121211100002022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220200001112121 - 215 = 220200001079353 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 220200001112121.
It is not an unprimeable number, because it can be changed into a prime (220200001112123) 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, 2288980791 + ... + 2289076988.
It is an arithmetic number, because the mean of its divisors is an integer number (36702289222260).
Almost surely, 2220200001112121 is an apocalyptic number.
It is an amenable number.
220200001112121 is a deficient number, since it is larger than the sum of its proper divisors (73418312665959).
220200001112121 is a wasteful number, since it uses less digits than its factorization.
220200001112121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4578073815.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 220200001112121 its reverse (121211100002022), we get a palindrome (341411101114143).
The spelling of 220200001112121 in words is "two hundred twenty trillion, two hundred billion, one million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •