Base | Representation |
---|---|
bin | 1010000001100000011011… |
… | …1010010001010010110101 |
3 | 1110000121010120122211121210 |
4 | 2200120012322101102311 |
5 | 2421032003004120041 |
6 | 35234551201432033 |
7 | 2215145463333360 |
oct | 240300672212265 |
9 | 43017116584553 |
10 | 11021002020021 |
11 | 3569a87361454 |
12 | 129bb3b33b619 |
13 | 61c378595436 |
14 | 2a15c29730d7 |
15 | 141a353a5016 |
hex | a0606e914b5 |
11021002020021 has 32 divisors (see below), whose sum is σ = 17045072271360. Its totient is φ = 6203534394816.
The previous prime is 11021002020011. The next prime is 11021002020031. The reversal of 11021002020021 is 12002020012011.
It is an interprime number because it is at equal distance from previous prime (11021002020011) and next prime (11021002020031).
It is not a de Polignac number, because 11021002020021 - 29 = 11021002019509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11021002019979 and 11021002020006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021002020001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 56868475 + ... + 57061943.
It is an arithmetic number, because the mean of its divisors is an integer number (532658508480).
Almost surely, 211021002020021 is an apocalyptic number.
It is an amenable number.
11021002020021 is a deficient number, since it is larger than the sum of its proper divisors (6024070251339).
11021002020021 is a wasteful number, since it uses less digits than its factorization.
11021002020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 234033.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11021002020021 its reverse (12002020012011), we get a palindrome (23023022032032).
The spelling of 11021002020021 in words is "eleven trillion, twenty-one billion, two million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •