Base | Representation |
---|---|
bin | 100000000010110010101… |
… | …100010010111101110110 |
3 | 21210111210122101202010000 |
4 | 200002302230102331312 |
5 | 242034214412241042 |
6 | 4403332232412130 |
7 | 315043065321342 |
oct | 40026254227566 |
9 | 7714718352100 |
10 | 2202021212022 |
11 | 779965627545 |
12 | 2b6924547046 |
13 | 12c85a546898 |
14 | 7881518c622 |
15 | 3c42db0474c |
hex | 200b2b12f76 |
2202021212022 has 20 divisors (see below), whose sum is σ = 4934158642116. Its totient is φ = 734007070620.
The previous prime is 2202021212011. The next prime is 2202021212033. The reversal of 2202021212022 is 2202121202022.
It is an interprime number because it is at equal distance from previous prime (2202021212011) and next prime (2202021212033).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 2202021211986 and 2202021212004.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 6796361604 + ... + 6796361927.
Almost surely, 22202021212022 is an apocalyptic number.
2202021212022 is an abundant number, since it is smaller than the sum of its proper divisors (2732137430094).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2202021212022 is a wasteful number, since it uses less digits than its factorization.
2202021212022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13592723545 (or 13592723536 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 2202021212022 its reverse (2202121202022), we get a palindrome (4404142414044).
The spelling of 2202021212022 in words is "two trillion, two hundred two billion, twenty-one million, two hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •