Base | Representation |
---|---|
bin | 10000001010110010110… |
… | …110001110010100000100 |
3 | 10221012221121122221221120 |
4 | 100022302312032110010 |
5 | 121201014120334340 |
6 | 2210233330313540 |
7 | 143163101125620 |
oct | 20126266162404 |
9 | 3835847587846 |
10 | 1111102121220 |
11 | 3992411a9a93 |
12 | 15b409a288b0 |
13 | 80a12c09a80 |
14 | 3bac5b5c180 |
15 | 1dd804b34d0 |
hex | 102b2d8e504 |
1111102121220 has 192 divisors, whose sum is σ = 3932516829696. Its totient is φ = 228094341120.
The previous prime is 1111102121203. The next prime is 1111102121231. The reversal of 1111102121220 is 221212011111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1111102121220.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2547961 + ... + 2952000.
It is an arithmetic number, because the mean of its divisors is an integer number (20481858488).
Almost surely, 21111102121220 is an apocalyptic number.
1111102121220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1111102121220 is an abundant number, since it is smaller than the sum of its proper divisors (2821414708476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111102121220 is a wasteful number, since it uses less digits than its factorization.
1111102121220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5500030 (or 5500028 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1111102121220 its reverse (221212011111), we get a palindrome (1332314132331).
The spelling of 1111102121220 in words is "one trillion, one hundred eleven billion, one hundred two million, one hundred twenty-one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •