Base | Representation |
---|---|
bin | 11001011101111101100010… |
… | …111000100111001011110000 |
3 | 112200121001200020020202100020 |
4 | 121131331202320213023300 |
5 | 104140133201421320422 |
6 | 1034120422405123440 |
7 | 32410314654235122 |
oct | 3135754270471360 |
9 | 480531606222306 |
10 | 112010111120112 |
11 | 327652486a2197 |
12 | 106903876b9580 |
13 | 4a6667b55b12a |
14 | 1d934655db212 |
15 | ce39901ec95c |
hex | 65df62e272f0 |
112010111120112 has 40 divisors (see below), whose sum is σ = 289473240693504. Its totient is φ = 37322021517504.
The previous prime is 112010111120111. The next prime is 112010111120143. The reversal of 112010111120112 is 211021111010211.
It is a junction number, because it is equal to n+sod(n) for n = 112010111120091 and 112010111120100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112010111120111) 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, 458695078 + ... + 458939205.
Almost surely, 2112010111120112 is an apocalyptic number.
112010111120112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112010111120112 is an abundant number, since it is smaller than the sum of its proper divisors (177463129573392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112010111120112 is a wasteful number, since it uses less digits than its factorization.
112010111120112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 917636837 (or 917636831 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 112010111120112 its reverse (211021111010211), we get a palindrome (323031222130323).
The spelling of 112010111120112 in words is "one hundred twelve trillion, ten billion, one hundred eleven million, one hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •