Base | Representation |
---|---|
bin | 1001000110000111001001… |
… | …00010111101111111001101 |
3 | 2121211002121011102121220020 |
4 | 10203003210202331333031 |
5 | 10110144430214232341 |
6 | 110312231515212353 |
7 | 4133016301514034 |
oct | 443034442757715 |
9 | 77732534377806 |
10 | 20001202102221 |
11 | 641150a17a24a |
12 | 22b044a1470b9 |
13 | b2114a363022 |
14 | 4d20c5b7771b |
15 | 24a425689566 |
hex | 1230e48bdfcd |
20001202102221 has 8 divisors (see below), whose sum is σ = 26668333237344. Its totient is φ = 13334102850960.
The previous prime is 20001202102187. The next prime is 20001202102241. The reversal of 20001202102221 is 12220120210002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20001202102221 - 27 = 20001202102093 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 20001202102221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001202102241) 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, 6466675 + ... + 9045456.
It is an arithmetic number, because the mean of its divisors is an integer number (3333541654668).
Almost surely, 220001202102221 is an apocalyptic number.
It is an amenable number.
20001202102221 is a deficient number, since it is larger than the sum of its proper divisors (6667131135123).
20001202102221 is a wasteful number, since it uses less digits than its factorization.
20001202102221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15941931.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 20001202102221 its reverse (12220120210002), we get a palindrome (32221322312223).
The spelling of 20001202102221 in words is "twenty trillion, one billion, two hundred two million, one hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •