Base | Representation |
---|---|
bin | 1010000110110011110111… |
… | …1110001111011100010110 |
3 | 1110100022022202102222002120 |
4 | 2201230331332033130112 |
5 | 2424030110222333420 |
6 | 35344500522520410 |
7 | 2224552460403021 |
oct | 241547576173426 |
9 | 43308282388076 |
10 | 11112120121110 |
11 | 35a4695130428 |
12 | 12b572a666106 |
13 | 627b39c35398 |
14 | 2a5b881621b8 |
15 | 1440b9990d40 |
hex | a1b3df8f716 |
11112120121110 has 128 divisors (see below), whose sum is σ = 27132908774400. Its totient is φ = 2912169601536.
The previous prime is 11112120121057. The next prime is 11112120121127. The reversal of 11112120121110 is 1112102121111.
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 11112120121110.
It is a congruent number.
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, 546496504 + ... + 546516836.
It is an arithmetic number, because the mean of its divisors is an integer number (211975849800).
Almost surely, 211112120121110 is an apocalyptic number.
11112120121110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11112120121110 is an abundant number, since it is smaller than the sum of its proper divisors (16020788653290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11112120121110 is a wasteful number, since it uses less digits than its factorization.
11112120121110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21782.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 11112120121110 its reverse (1112102121111), we get a palindrome (12224222242221).
The spelling of 11112120121110 in words is "eleven trillion, one hundred twelve billion, one hundred twenty million, one hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •