Base | Representation |
---|---|
bin | 11001011111011010110000… |
… | …101101001101100010000000 |
3 | 112200221122000200000120111220 |
4 | 121133122300231031202000 |
5 | 104143303142424031422 |
6 | 1034234414302435040 |
7 | 32420460202215225 |
oct | 3137326055154200 |
9 | 480848020016456 |
10 | 112110201002112 |
11 | 327a373a838a35 |
12 | 106a785b592a80 |
13 | 4a72c3c87ab91 |
14 | 1d9823c57794c |
15 | ce639c28de5c |
hex | 65f6b0b4d880 |
112110201002112 has 64 divisors (see below), whose sum is σ = 313466022559200. Its totient is φ = 35403221366784.
The previous prime is 112110201002087. The next prime is 112110201002159. The reversal of 112110201002112 is 211200102011211.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 112110201002091 and 112110201002100.
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, 7682983453 + ... + 7682998044.
Almost surely, 2112110201002112 is an apocalyptic number.
112110201002112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112110201002112 is an abundant number, since it is smaller than the sum of its proper divisors (201355821557088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112110201002112 is a wasteful number, since it uses less digits than its factorization.
112110201002112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15365981533 (or 15365981521 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 112110201002112 its reverse (211200102011211), we get a palindrome (323310303013323).
The spelling of 112110201002112 in words is "one hundred twelve trillion, one hundred ten billion, two hundred one million, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •