Base | Representation |
---|---|
bin | 1010000001100000110101… |
… | …0110001110010010001101 |
3 | 1110000121102002212100102110 |
4 | 2200120031112032102031 |
5 | 2421032213130323041 |
6 | 35235010020214233 |
7 | 2215151244260055 |
oct | 240301526162215 |
9 | 43017362770373 |
10 | 11021110011021 |
11 | 356a032310710 |
12 | 129bb6b53a379 |
13 | 61c394a76236 |
14 | 2a15d3044565 |
15 | 141a3ead7516 |
hex | a060d58e48d |
11021110011021 has 32 divisors (see below), whose sum is σ = 16137190656000. Its totient is φ = 6635222881280.
The previous prime is 11021110011019. The next prime is 11021110011073. The reversal of 11021110011021 is 12011001112011.
It is a cyclic number.
It is not a de Polignac number, because 11021110011021 - 21 = 11021110011019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11021110010988 and 11021110011006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021110011091) 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, 1725100 + ... + 5001818.
It is an arithmetic number, because the mean of its divisors is an integer number (504287208000).
Almost surely, 211021110011021 is an apocalyptic number.
11021110011021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11021110011021 is a deficient number, since it is larger than the sum of its proper divisors (5116080644979).
11021110011021 is a wasteful number, since it uses less digits than its factorization.
11021110011021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3277409.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11021110011021 its reverse (12011001112011), we get a palindrome (23032111123032).
The spelling of 11021110011021 in words is "eleven trillion, twenty-one billion, one hundred ten million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •