Base | Representation |
---|---|
bin | 11101010011001000110… |
… | …111001110010001110010 |
3 | 21010110222022210212002110 |
4 | 131103020313032101302 |
5 | 230441433120123010 |
6 | 4140541102430150 |
7 | 265315201562163 |
oct | 35231067162162 |
9 | 7113868725073 |
10 | 2013414614130 |
11 | 706980072a47 |
12 | 286268592356 |
13 | 117b307c347a |
14 | 6d64230576a |
15 | 37590a2d120 |
hex | 1d4c8dce472 |
2013414614130 has 64 divisors (see below), whose sum is σ = 4910280496128. Its totient is φ = 528253894080.
The previous prime is 2013414614093. The next prime is 2013414614131. The reversal of 2013414614130 is 314164143102.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (2013414614131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1045665 + ... + 2262795.
It is an arithmetic number, because the mean of its divisors is an integer number (76723132752).
Almost surely, 22013414614130 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2013414614130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2455140248064).
2013414614130 is an abundant number, since it is smaller than the sum of its proper divisors (2896865881998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2013414614130 is a wasteful number, since it uses less digits than its factorization.
2013414614130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1218031.
The product of its (nonzero) digits is 6912, while the sum is 30.
Adding to 2013414614130 its reverse (314164143102), we get a palindrome (2327578757232).
The spelling of 2013414614130 in words is "two trillion, thirteen billion, four hundred fourteen million, six hundred fourteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •