Base | Representation |
---|---|
bin | 11001011111011010100101… |
… | …010100101000110101101100 |
3 | 112200221121112100122012221120 |
4 | 121133122211110220311230 |
5 | 104143302300030322423 |
6 | 1034234343321100540 |
7 | 32420452362631623 |
oct | 3137324524506554 |
9 | 480847470565846 |
10 | 112110010010988 |
11 | 327a3651a49530 |
12 | 106a7807627750 |
13 | 4a72c0c129292 |
14 | 1d9822105c6ba |
15 | ce638a613ee3 |
hex | 65f6a5528d6c |
112110010010988 has 96 divisors (see below), whose sum is σ = 298948164480000. Its totient is φ = 32386050977280.
The previous prime is 112110010010963. The next prime is 112110010010989. The reversal of 112110010010988 is 889010010011211.
It is a happy number.
It is a super-3 number, since 3×1121100100109883 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (112110010010989) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 185057313 + ... + 185662136.
It is an arithmetic number, because the mean of its divisors is an integer number (3114043380000).
Almost surely, 2112110010010988 is an apocalyptic number.
It is an amenable number.
112110010010988 is an abundant number, since it is smaller than the sum of its proper divisors (186838154469012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112110010010988 is a wasteful number, since it uses less digits than its factorization.
112110010010988 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 370719575 (or 370719573 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 33.
The spelling of 112110010010988 in words is "one hundred twelve trillion, one hundred ten billion, ten million, ten thousand, nine hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •