Base | Representation |
---|---|
bin | 1001010010111100111100… |
… | …0111010100100101011011 |
3 | 1100012010201010211010220011 |
4 | 2110233033013110211123 |
5 | 2314431010203001334 |
6 | 33423315543342351 |
7 | 2103312625334110 |
oct | 224571707244533 |
9 | 40163633733804 |
10 | 10221202000219 |
11 | 3290873076851 |
12 | 1190b2ba519b7 |
13 | 591b16b97052 |
14 | 2749ccdc6907 |
15 | 12ad24916564 |
hex | 94bcf1d495b |
10221202000219 has 8 divisors (see below), whose sum is σ = 11694909496320. Its totient is φ = 8750878449576.
The previous prime is 10221202000157. The next prime is 10221202000231. The reversal of 10221202000219 is 91200020212201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10221202000219 is a prime.
It is a super-2 number, since 2×102212020002192 (a number of 27 digits) contains 22 as substring.
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 10221202000219.
It is not an unprimeable number, because it can be changed into a prime (10221202000259) 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, 845979889 + ... + 845991970.
It is an arithmetic number, because the mean of its divisors is an integer number (1461863687040).
Almost surely, 210221202000219 is an apocalyptic number.
10221202000219 is a deficient number, since it is larger than the sum of its proper divisors (1473707496101).
10221202000219 is an equidigital number, since it uses as much as digits as its factorization.
10221202000219 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1691972729.
The product of its (nonzero) digits is 288, while the sum is 22.
The spelling of 10221202000219 in words is "ten trillion, two hundred twenty-one billion, two hundred two million, two hundred nineteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •