Base | Representation |
---|---|
bin | 1010000111011001011111… |
… | …1110001110101100111110 |
3 | 1110101021101122011002012020 |
4 | 2201312113332032230332 |
5 | 2424211301310031420 |
6 | 35353251034221010 |
7 | 2225360660103150 |
oct | 241662776165476 |
9 | 43337348132166 |
10 | 11122220002110 |
11 | 35a89a8265518 |
12 | 12b7688b84766 |
13 | 628a89524129 |
14 | 2a6465684ad0 |
15 | 1444ab4cd340 |
hex | a1d97f8eb3e |
11122220002110 has 32 divisors (see below), whose sum is σ = 30506660577792. Its totient is φ = 2542221714720.
The previous prime is 11122220002099. The next prime is 11122220002139. The reversal of 11122220002110 is 1120002222111.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11122220002110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26481475986 + ... + 26481476405.
It is an arithmetic number, because the mean of its divisors is an integer number (953333143056).
Almost surely, 211122220002110 is an apocalyptic number.
11122220002110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11122220002110 is an abundant number, since it is smaller than the sum of its proper divisors (19384440575682).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11122220002110 is a wasteful number, since it uses less digits than its factorization.
11122220002110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52962952408.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11122220002110 its reverse (1120002222111), we get a palindrome (12242222224221).
The spelling of 11122220002110 in words is "eleven trillion, one hundred twenty-two billion, two hundred twenty million, two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •