Base | Representation |
---|---|
bin | 1010000001011100110001… |
… | …1111110010110101111101 |
3 | 1110000111121021120201021210 |
4 | 2200113030133302311331 |
5 | 2421023001113013041 |
6 | 35234310032315033 |
7 | 2215112263322205 |
oct | 240271437626575 |
9 | 43014537521253 |
10 | 11020022001021 |
11 | 35696241456a0 |
12 | 129b9070a2a79 |
13 | 61c250532b37 |
14 | 2a152c747405 |
15 | 1419c931e016 |
hex | a05cc7f2d7d |
11020022001021 has 16 divisors (see below), whose sum is σ = 16035821363520. Its totient is φ = 6676010190720.
The previous prime is 11020022000951. The next prime is 11020022001067. The reversal of 11020022001021 is 12010022002011.
It is not a de Polignac number, because 11020022001021 - 210 = 11020021999997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11020022000988 and 11020022001006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020022001071) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 69695386 + ... + 69853323.
It is an arithmetic number, because the mean of its divisors is an integer number (1002238835220).
Almost surely, 211020022001021 is an apocalyptic number.
11020022001021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11020022001021 is a deficient number, since it is larger than the sum of its proper divisors (5015799362499).
11020022001021 is a wasteful number, since it uses less digits than its factorization.
11020022001021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139551116.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11020022001021 its reverse (12010022002011), we get a palindrome (23030044003032).
The spelling of 11020022001021 in words is "eleven trillion, twenty billion, twenty-two million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •