Base | Representation |
---|---|
bin | 10110110000110011101111… |
… | …010001101000000010001100 |
3 | 111010110112021112100120002012 |
4 | 112300303233101220002030 |
5 | 101110210024200011340 |
6 | 552530224320520352 |
7 | 30041534453404451 |
oct | 2660635721500214 |
9 | 433415245316065 |
10 | 100111112110220 |
11 | 2999797a993142 |
12 | b28a254a800b8 |
13 | 43b258bb73a23 |
14 | 1aa15919a7828 |
15 | b891be341565 |
hex | 5b0cef46808c |
100111112110220 has 48 divisors (see below), whose sum is σ = 226800002304288. Its totient is φ = 36977778140160.
The previous prime is 100111112110171. The next prime is 100111112110253. The reversal of 100111112110220 is 22011211111001.
It is a junction number, because it is equal to n+sod(n) for n = 100111112110195 and 100111112110204.
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, 2777759786 + ... + 2777795825.
It is an arithmetic number, because the mean of its divisors is an integer number (4725000048006).
Almost surely, 2100111112110220 is an apocalyptic number.
100111112110220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100111112110220 is an abundant number, since it is smaller than the sum of its proper divisors (126688890194068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100111112110220 is a wasteful number, since it uses less digits than its factorization.
100111112110220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5555555690 (or 5555555688 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 100111112110220 its reverse (22011211111001), we get a palindrome (122122323221221).
The spelling of 100111112110220 in words is "one hundred trillion, one hundred eleven billion, one hundred twelve million, one hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •