Base | Representation |
---|---|
bin | 11110101110111110001… |
… | …101011000001000110000 |
3 | 21110220111022110120011120 |
4 | 132232332031120020300 |
5 | 234100404122320422 |
6 | 4254125412542240 |
7 | 305405553546360 |
oct | 36567615301060 |
9 | 7426438416146 |
10 | 2112020120112 |
11 | 744780330051 |
12 | 2a13a7321980 |
13 | 124216431606 |
14 | 743180889a0 |
15 | 39e1260e45c |
hex | 1ebbe358230 |
2112020120112 has 80 divisors (see below), whose sum is σ = 6506596170240. Its totient is φ = 577198043136.
The previous prime is 2112020120107. The next prime is 2112020120117. The reversal of 2112020120112 is 2110210202112.
It is an interprime number because it is at equal distance from previous prime (2112020120107) and next prime (2112020120117).
It is a junction number, because it is equal to n+sod(n) for n = 2112020120091 and 2112020120100.
It is not an unprimeable number, because it can be changed into a prime (2112020120117) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 136639537 + ... + 136654992.
It is an arithmetic number, because the mean of its divisors is an integer number (81332452128).
Almost surely, 22112020120112 is an apocalyptic number.
It is an amenable number.
2112020120112 is an abundant number, since it is smaller than the sum of its proper divisors (4394576050128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2112020120112 is a wasteful number, since it uses less digits than its factorization.
2112020120112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273294570 (or 273294564 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2112020120112 its reverse (2110210202112), we get a palindrome (4222230322224).
The spelling of 2112020120112 in words is "two trillion, one hundred twelve billion, twenty million, one hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •