Base | Representation |
---|---|
bin | 11001011101111101101000… |
… | …010011101111111110110001 |
3 | 112200121001220120111000212122 |
4 | 121131331220103233332301 |
5 | 104140133343220320423 |
6 | 1034120435415404025 |
7 | 32410320140564213 |
oct | 3135755023577661 |
9 | 480531816430778 |
10 | 112010202120113 |
11 | 32765294aa6900 |
12 | 106903b2083615 |
13 | 4a6669437029b |
14 | 1d934737285b3 |
15 | ce39981c58c8 |
hex | 65df684effb1 |
112010202120113 has 48 divisors (see below), whose sum is σ = 129138312441600. Its totient is φ = 96894899544960.
The previous prime is 112010202120049. The next prime is 112010202120133. The reversal of 112010202120113 is 311021202010211.
It is a happy number.
It is not a de Polignac number, because 112010202120113 - 26 = 112010202120049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112010202120091 and 112010202120100.
It is not an unprimeable number, because it can be changed into a prime (112010202120133) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4495320131 + ... + 4495345047.
It is an arithmetic number, because the mean of its divisors is an integer number (2690381509200).
Almost surely, 2112010202120113 is an apocalyptic number.
It is an amenable number.
112010202120113 is a deficient number, since it is larger than the sum of its proper divisors (17128110321487).
112010202120113 is a wasteful number, since it uses less digits than its factorization.
112010202120113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33278 (or 33267 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 112010202120113 its reverse (311021202010211), we get a palindrome (423031404130324).
The spelling of 112010202120113 in words is "one hundred twelve trillion, ten billion, two hundred two million, one hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •