Base | Representation |
---|---|
bin | 11110101110111101100… |
… | …111001100100011110100 |
3 | 21110220110121122001112212 |
4 | 132232331213030203310 |
5 | 234100344042024340 |
6 | 4254124414232552 |
7 | 305405402512052 |
oct | 36567547144364 |
9 | 7426417561485 |
10 | 2112010111220 |
11 | 744775714239 |
12 | 2a13a3ab5758 |
13 | 1242143389a9 |
14 | 74316a011d2 |
15 | 39e117d3a65 |
hex | 1ebbd9cc8f4 |
2112010111220 has 24 divisors (see below), whose sum is σ = 4435563501600. Its totient is φ = 844738850592.
The previous prime is 2112010111219. The next prime is 2112010111229. The reversal of 2112010111220 is 221110102112.
It is a junction number, because it is equal to n+sod(n) for n = 2112010111195 and 2112010111204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112010111229) 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, 3808550 + ... + 4327709.
It is an arithmetic number, because the mean of its divisors is an integer number (184815145900).
Almost surely, 22112010111220 is an apocalyptic number.
2112010111220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2112010111220 is an abundant number, since it is smaller than the sum of its proper divisors (2323553390380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2112010111220 is a wasteful number, since it uses less digits than its factorization.
2112010111220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8149247 (or 8149245 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2112010111220 its reverse (221110102112), we get a palindrome (2333120213332).
The spelling of 2112010111220 in words is "two trillion, one hundred twelve billion, ten million, one hundred eleven thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •