Base | Representation |
---|---|
bin | 1010000110001010011100… |
… | …11000100011001000001001 |
3 | 2220121111020121211221110111 |
4 | 11003011032120203020021 |
5 | 10402224144224324314 |
6 | 115115243005514321 |
7 | 4451020165546615 |
oct | 503051630431011 |
9 | 86544217757414 |
10 | 22202001011209 |
11 | 708a8a7847398 |
12 | 25a6a912729a1 |
13 | c508415a6976 |
14 | 56a82286c345 |
15 | 2877d1ce9ec4 |
hex | 14314e623209 |
22202001011209 has 8 divisors (see below), whose sum is σ = 23370986708640. Its totient is φ = 21033061246656.
The previous prime is 22202001011161. The next prime is 22202001011213. The reversal of 22202001011209 is 90211010020222.
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 22202001011209 - 211 = 22202001009161 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22202001011209.
It is not an unprimeable number, because it can be changed into a prime (22202001011249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10488847 + ... + 12426580.
It is an arithmetic number, because the mean of its divisors is an integer number (2921373338580).
Almost surely, 222202001011209 is an apocalyptic number.
It is an amenable number.
22202001011209 is a deficient number, since it is larger than the sum of its proper divisors (1168985697431).
22202001011209 is a wasteful number, since it uses less digits than its factorization.
22202001011209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22966439.
The product of its (nonzero) digits is 288, while the sum is 22.
The spelling of 22202001011209 in words is "twenty-two trillion, two hundred two billion, one million, eleven thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •