Base | Representation |
---|---|
bin | 11001001111011100000000… |
… | …000001100100101010001100 |
3 | 112120001122102112221011102220 |
4 | 121033130000001210222030 |
5 | 104022310104122041022 |
6 | 1032034115031015340 |
7 | 32245232226526125 |
oct | 3117340001445214 |
9 | 476048375834386 |
10 | 111012020112012 |
11 | 3240aa2a304158 |
12 | 1054aa58b0a550 |
13 | 49c3508923bc6 |
14 | 1d5b02091d04c |
15 | cc7a2636d85c |
hex | 64f700064a8c |
111012020112012 has 24 divisors (see below), whose sum is σ = 259101488491776. Its totient is φ = 36993515052048.
The previous prime is 111012020111903. The next prime is 111012020112029. The reversal of 111012020112012 is 210211020210111.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 111012020111982 and 111012020112000.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1311412408 + ... + 1311497055.
It is an arithmetic number, because the mean of its divisors is an integer number (10795895353824).
Almost surely, 2111012020112012 is an apocalyptic number.
111012020112012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
111012020112012 is an abundant number, since it is smaller than the sum of its proper divisors (148089468379764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111012020112012 is a wasteful number, since it uses less digits than its factorization.
111012020112012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2622912997 (or 2622912995 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 111012020112012 its reverse (210211020210111), we get a palindrome (321223040322123).
The spelling of 111012020112012 in words is "one hundred eleven trillion, twelve billion, twenty million, one hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •