Base | Representation |
---|---|
bin | 11110100100110011111… |
… | …111001100010001101000 |
3 | 21102212100001102120021220 |
4 | 132210303333030101220 |
5 | 233411033432223422 |
6 | 4245123121102040 |
7 | 304541331422064 |
oct | 36446377142150 |
9 | 7385301376256 |
10 | 2101111211112 |
11 | 740092559281 |
12 | 29b261a87920 |
13 | 12319834b684 |
14 | 739a132aaa4 |
15 | 399c4a64e5c |
hex | 1e933fcc468 |
2101111211112 has 64 divisors (see below), whose sum is σ = 5442308092800. Its totient is φ = 675174393600.
The previous prime is 2101111211107. The next prime is 2101111211117. The reversal of 2101111211112 is 2111121111012.
It is an interprime number because it is at equal distance from previous prime (2101111211107) and next prime (2101111211117).
It is a junction number, because it is equal to n+sod(n) for n = 2101111211091 and 2101111211100.
It is not an unprimeable number, because it can be changed into a prime (2101111211117) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1882639 + ... + 2783262.
It is an arithmetic number, because the mean of its divisors is an integer number (85036063950).
Almost surely, 22101111211112 is an apocalyptic number.
It is an amenable number.
2101111211112 is an abundant number, since it is smaller than the sum of its proper divisors (3341196881688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2101111211112 is a wasteful number, since it uses less digits than its factorization.
2101111211112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4666586 (or 4666582 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 2101111211112 its reverse (2111121111012), we get a palindrome (4212232322124).
The spelling of 2101111211112 in words is "two trillion, one hundred one billion, one hundred eleven million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •