Base | Representation |
---|---|
bin | 11101000110110000100… |
… | …100010110000010100000 |
3 | 21002012122221121200112211 |
4 | 131012300210112002200 |
5 | 230232222230010422 |
6 | 4130502102131504 |
7 | 264334614265150 |
oct | 35066044260240 |
9 | 7065587550484 |
10 | 2000122110112 |
11 | 701279873a35 |
12 | 283778a20b94 |
13 | 1167c2949889 |
14 | 6cb40b98760 |
15 | 37063a9d577 |
hex | 1d1b09160a0 |
2000122110112 has 96 divisors (see below), whose sum is σ = 4513394196864. Its totient is φ = 854698521600.
The previous prime is 2000122110067. The next prime is 2000122110121. The reversal of 2000122110112 is 2110112210002.
It is a junction number, because it is equal to n+sod(n) for n = 2000122110092 and 2000122110101.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 220006687 + ... + 220015777.
It is an arithmetic number, because the mean of its divisors is an integer number (47014522884).
Almost surely, 22000122110112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2000122110112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2256697098432).
2000122110112 is an abundant number, since it is smaller than the sum of its proper divisors (2513272086752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000122110112 is a wasteful number, since it uses less digits than its factorization.
2000122110112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11862 (or 11854 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2000122110112 its reverse (2110112210002), we get a palindrome (4110234320114).
The spelling of 2000122110112 in words is "two trillion, one hundred twenty-two million, one hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •