Base | Representation |
---|---|
bin | 100000000010110010000… |
… | …010101011001100100101 |
3 | 21210111202212212102022021 |
4 | 200002302002223030211 |
5 | 242034204114114341 |
6 | 4403331202503141 |
7 | 315042603506413 |
oct | 40026202531445 |
9 | 7714685772267 |
10 | 2202010301221 |
11 | 77995a455055 |
12 | 2b6920964ab1 |
13 | 12c8581c65a3 |
14 | 7881394c2b3 |
15 | 3c42cb9b9d1 |
hex | 200b20ab325 |
2202010301221 has 8 divisors (see below), whose sum is σ = 2226738175200. Its totient is φ = 2177364717360.
The previous prime is 2202010301173. The next prime is 2202010301263. The reversal of 2202010301221 is 1221030102022.
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 2202010301221 - 27 = 2202010301093 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2202010301195 and 2202010301204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2202010301021) 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, 20518711 + ... + 20625748.
It is an arithmetic number, because the mean of its divisors is an integer number (278342271900).
Almost surely, 22202010301221 is an apocalyptic number.
It is an amenable number.
2202010301221 is a deficient number, since it is larger than the sum of its proper divisors (24727873979).
2202010301221 is a wasteful number, since it uses less digits than its factorization.
2202010301221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41145059.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 2202010301221 its reverse (1221030102022), we get a palindrome (3423040403243).
The spelling of 2202010301221 in words is "two trillion, two hundred two billion, ten million, three hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •