Base | Representation |
---|---|
bin | 11001001111011011001111… |
… | …110111010000100111101000 |
3 | 112120001120100020112000020121 |
4 | 121033123033313100213220 |
5 | 104022301430244231440 |
6 | 1032033502524333024 |
7 | 32245203215542141 |
oct | 3117331767204750 |
9 | 476046306460217 |
10 | 111011212102120 |
11 | 3240a6551a2390 |
12 | 1054a8723a4174 |
13 | 49c340a3c8245 |
14 | 1d5ad854aaac8 |
15 | cc79ca46334a |
hex | 64f6cfdd09e8 |
111011212102120 has 64 divisors (see below), whose sum is σ = 272513434881600. Its totient is φ = 40363066260480.
The previous prime is 111011212102099. The next prime is 111011212102169. The reversal of 111011212102120 is 21201212110111.
It is a junction number, because it is equal to n+sod(n) for n = 111011212102094 and 111011212102103.
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, 10695094 + ... + 18341413.
It is an arithmetic number, because the mean of its divisors is an integer number (4258022420025).
Almost surely, 2111011212102120 is an apocalyptic number.
111011212102120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111011212102120 is an abundant number, since it is smaller than the sum of its proper divisors (161502222779480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111011212102120 is a wasteful number, since it uses less digits than its factorization.
111011212102120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29045218 (or 29045214 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 111011212102120 its reverse (21201212110111), we get a palindrome (132212424212231).
The spelling of 111011212102120 in words is "one hundred eleven trillion, eleven billion, two hundred twelve million, one hundred two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •