Base | Representation |
---|---|
bin | 1010000110110011110011… |
… | …1001111101000011110101 |
3 | 1110100022021111202111102021 |
4 | 2201230330321331003311 |
5 | 2424030041132020041 |
6 | 35344455043113141 |
7 | 2224552152265165 |
oct | 241547471750365 |
9 | 43308244674367 |
10 | 11112102220021 |
11 | 35a4686014040 |
12 | 12b57246727b1 |
13 | 627b3630841a |
14 | 2a5b85a225a5 |
15 | 1440b8106cd1 |
hex | a1b3ce7d0f5 |
11112102220021 has 32 divisors (see below), whose sum is σ = 12266664883200. Its totient is φ = 9982316023680.
The previous prime is 11112102219923. The next prime is 11112102220033. The reversal of 11112102220021 is 12002220121111.
It is not a de Polignac number, because 11112102220021 - 29 = 11112102219509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11112102219977 and 11112102220004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11112102220081) 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, 1324915590 + ... + 1324923976.
It is an arithmetic number, because the mean of its divisors is an integer number (383333277600).
Almost surely, 211112102220021 is an apocalyptic number.
11112102220021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11112102220021 is a deficient number, since it is larger than the sum of its proper divisors (1154562663179).
11112102220021 is a wasteful number, since it uses less digits than its factorization.
11112102220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12489.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11112102220021 its reverse (12002220121111), we get a palindrome (23114322341132).
The spelling of 11112102220021 in words is "eleven trillion, one hundred twelve billion, one hundred two million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •