Base | Representation |
---|---|
bin | 100000000010110001011… |
… | …111001110111000101101 |
3 | 21210111202020101101110011 |
4 | 200002301133032320231 |
5 | 242034144224311341 |
6 | 4403330231413221 |
7 | 315042431522065 |
oct | 40026137167055 |
9 | 7714666341404 |
10 | 2202001010221 |
11 | 779955189641 |
12 | 2b6919824211 |
13 | 12c8562c265c |
14 | 788126103a5 |
15 | 3c42be63b81 |
hex | 200b17cee2d |
2202001010221 has 4 divisors (see below), whose sum is σ = 2202021670492. Its totient is φ = 2201980349952.
The previous prime is 2202001010219. The next prime is 2202001010263. The reversal of 2202001010221 is 1220101002022.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1303513141225 + 898487868996 = 1141715^2 + 947886^2 .
It is a cyclic number.
It is not a de Polignac number, because 2202001010221 - 21 = 2202001010219 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2202001013221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10169430 + ... + 10383703.
It is an arithmetic number, because the mean of its divisors is an integer number (550505417623).
Almost surely, 22202001010221 is an apocalyptic number.
It is an amenable number.
2202001010221 is a deficient number, since it is larger than the sum of its proper divisors (20660271).
2202001010221 is a wasteful number, since it uses less digits than its factorization.
2202001010221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20660270.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2202001010221 its reverse (1220101002022), we get a palindrome (3422102012243).
The spelling of 2202001010221 in words is "two trillion, two hundred two billion, one million, ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •