Base | Representation |
---|---|
bin | 11001010000101111110011… |
… | …111101110011010010101000 |
3 | 112120101020201020202022212010 |
4 | 121100233303331303102220 |
5 | 104030243410100004432 |
6 | 1032143320523515520 |
7 | 32254566301064151 |
oct | 3120576375632250 |
9 | 476336636668763 |
10 | 111102012109992 |
11 | 3244510a45a202 |
12 | 10564393088ba0 |
13 | 49cbb4aba3b57 |
14 | 1d6151a736928 |
15 | cca041b693cc |
hex | 650bf3f734a8 |
111102012109992 has 32 divisors (see below), whose sum is σ = 278978620730400. Its totient is φ = 36870858642624.
The previous prime is 111102012109967. The next prime is 111102012109993. The reversal of 111102012109992 is 299901210201111.
It is a self number, because there is not a number n which added to its sum of digits gives 111102012109992.
It is not an unprimeable number, because it can be changed into a prime (111102012109993) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10196581567 + ... + 10196592462.
It is an arithmetic number, because the mean of its divisors is an integer number (8718081897825).
Almost surely, 2111102012109992 is an apocalyptic number.
111102012109992 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
111102012109992 is an abundant number, since it is smaller than the sum of its proper divisors (167876608620408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111102012109992 is a wasteful number, since it uses less digits than its factorization.
111102012109992 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20393174265 (or 20393174261 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 39.
The spelling of 111102012109992 in words is "one hundred eleven trillion, one hundred two billion, twelve million, one hundred nine thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •