Base | Representation |
---|---|
bin | 1010000110110000011100… |
… | …1001000100100001110110 |
3 | 1110100012221122110210112220 |
4 | 2201230013021010201312 |
5 | 2424021214223304420 |
6 | 35344225342023210 |
7 | 2224520620330344 |
oct | 241540711044166 |
9 | 43305848423486 |
10 | 11111200213110 |
11 | 35a4262940988 |
12 | 12b5512577b06 |
13 | 627a2148b41a |
14 | 2a5adbd02994 |
15 | 144063d30840 |
hex | a1b07244876 |
11111200213110 has 32 divisors (see below), whose sum is σ = 26673637036032. Its totient is φ = 2962235998560.
The previous prime is 11111200213033. The next prime is 11111200213133. The reversal of 11111200213110 is 1131200211111.
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 11111200213110.
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, 46799926 + ... + 47036745.
It is an arithmetic number, because the mean of its divisors is an integer number (833551157376).
Almost surely, 211111200213110 is an apocalyptic number.
11111200213110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11111200213110 is an abundant number, since it is smaller than the sum of its proper divisors (15562436822922).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11111200213110 is a wasteful number, since it uses less digits than its factorization.
11111200213110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93840628.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 11111200213110 its reverse (1131200211111), we get a palindrome (12242400424221).
The spelling of 11111200213110 in words is "eleven trillion, one hundred eleven billion, two hundred million, two hundred thirteen thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •