Base | Representation |
---|---|
bin | 11101010010111101010… |
… | …001010000011011110000 |
3 | 21010110110202211010111000 |
4 | 131102331101100123300 |
5 | 230441033322041422 |
6 | 4140505513522000 |
7 | 265310320413666 |
oct | 35227521203360 |
9 | 7113422733430 |
10 | 2013220112112 |
11 | 7068902a5780 |
12 | 286213413300 |
13 | 117acc412811 |
14 | 6d624554c36 |
15 | 3757d90ccac |
hex | 1d4bd4506f0 |
2013220112112 has 80 divisors (see below), whose sum is σ = 6304022588160. Its totient is φ = 610066699200.
The previous prime is 2013220112089. The next prime is 2013220112117. The reversal of 2013220112112 is 2112110223102.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2013220112117) 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, 211823964 + ... + 211833467.
It is an arithmetic number, because the mean of its divisors is an integer number (78800282352).
Almost surely, 22013220112112 is an apocalyptic number.
2013220112112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2013220112112 is an abundant number, since it is smaller than the sum of its proper divisors (4290802476048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2013220112112 is a wasteful number, since it uses less digits than its factorization.
2013220112112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 423657459 (or 423657447 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 2013220112112 its reverse (2112110223102), we get a palindrome (4125330335214).
The spelling of 2013220112112 in words is "two trillion, thirteen billion, two hundred twenty million, one hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •