Base | Representation |
---|---|
bin | 10000000001011111011… |
… | …001011011101001001000 |
3 | 10220021011101201211110012 |
4 | 100001133121123221020 |
5 | 121020034201130440 |
6 | 2201502142211052 |
7 | 142360404451262 |
oct | 20013731335110 |
9 | 3807141654405 |
10 | 1101112130120 |
11 | 394a851008a2 |
12 | 1594a0283a88 |
13 | 7cab0315232 |
14 | 3b419082b32 |
15 | 1d998430e65 |
hex | 1005f65ba48 |
1101112130120 has 64 divisors (see below), whose sum is σ = 2645341269120. Its totient is φ = 411497501184.
The previous prime is 1101112130117. The next prime is 1101112130177. The reversal of 1101112130120 is 210312111011.
It is a super-2 number, since 2×11011121301202 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1101112130095 and 1101112130104.
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, 13877429 + ... + 13956548.
It is an arithmetic number, because the mean of its divisors is an integer number (41333457330).
Almost surely, 21101112130120 is an apocalyptic number.
1101112130120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101112130120 is an abundant number, since it is smaller than the sum of its proper divisors (1544229139000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101112130120 is a wasteful number, since it uses less digits than its factorization.
1101112130120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27834054 (or 27834050 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1101112130120 its reverse (210312111011), we get a palindrome (1311424241131).
The spelling of 1101112130120 in words is "one trillion, one hundred one billion, one hundred twelve million, one hundred thirty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •