Base | Representation |
---|---|
bin | 1010001100000010110001… |
… | …1011001001011111001101 |
3 | 1110122220101000222010100122 |
4 | 2203000230123021133031 |
5 | 2432013214111202341 |
6 | 35454045325434325 |
7 | 2234214333063050 |
oct | 243005433113715 |
9 | 43586330863318 |
10 | 11202020022221 |
11 | 36298282a2766 |
12 | 130b039a0b9a5 |
13 | 6334660aab42 |
14 | 2aa275a44a97 |
15 | 1465cc14894b |
hex | a302c6c97cd |
11202020022221 has 8 divisors (see below), whose sum is σ = 12802329181824. Its totient is φ = 9601716008880.
The previous prime is 11202020022217. The next prime is 11202020022251. The reversal of 11202020022221 is 12222002020211.
It is a happy number.
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 11202020022221 - 22 = 11202020022217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11202020022221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11202020022251) 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, 6604496 + ... + 8125478.
It is an arithmetic number, because the mean of its divisors is an integer number (1600291147728).
Almost surely, 211202020022221 is an apocalyptic number.
It is an amenable number.
11202020022221 is a deficient number, since it is larger than the sum of its proper divisors (1600309159603).
11202020022221 is a wasteful number, since it uses less digits than its factorization.
11202020022221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2573131.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 11202020022221 its reverse (12222002020211), we get a palindrome (23424022042432).
The spelling of 11202020022221 in words is "eleven trillion, two hundred two billion, twenty million, twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •