Base | Representation |
---|---|
bin | 1010000000111000001111… |
… | …0010011010110110001110 |
3 | 1102222120021121201210201120 |
4 | 2200032003302122312032 |
5 | 2420342403311241420 |
6 | 35230004402421410 |
7 | 2214314215434426 |
oct | 240160362326616 |
9 | 42876247653646 |
10 | 11010212212110 |
11 | 356544a838031 |
12 | 1299a29961866 |
13 | 61b349083207 |
14 | 2a0c7b979486 |
15 | 141602ed4d40 |
hex | a0383c9ad8e |
11010212212110 has 64 divisors (see below), whose sum is σ = 27144703065600. Its totient is φ = 2856070253952.
The previous prime is 11010212212039. The next prime is 11010212212133. The reversal of 11010212212110 is 1121221201011.
It is a happy number.
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 11010212212110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3918601 + ... + 6113579.
It is an arithmetic number, because the mean of its divisors is an integer number (424135985400).
Almost surely, 211010212212110 is an apocalyptic number.
11010212212110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11010212212110 is an abundant number, since it is smaller than the sum of its proper divisors (16134490853490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010212212110 is a wasteful number, since it uses less digits than its factorization.
11010212212110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2199545.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11010212212110 its reverse (1121221201011), we get a palindrome (12131433413121).
The spelling of 11010212212110 in words is "eleven trillion, ten billion, two hundred twelve million, two hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •