Base | Representation |
---|---|
bin | 11101010010111100101… |
… | …010101011111101000100 |
3 | 21010110110001210102221112 |
4 | 131102330222223331010 |
5 | 230441023230014340 |
6 | 4140504513104152 |
7 | 265310135443115 |
oct | 35227452537504 |
9 | 7113401712845 |
10 | 2013210001220 |
11 | 70688561a270 |
12 | 28620bb58058 |
13 | 117aca2b2642 |
14 | 6d62308220c |
15 | 3757cab2065 |
hex | 1d4bcaabf44 |
2013210001220 has 48 divisors (see below), whose sum is σ = 4614761846016. Its totient is φ = 731650848000.
The previous prime is 2013210001219. The next prime is 2013210001247. The reversal of 2013210001220 is 221000123102.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 2013210001195 and 2013210001204.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2279996 + ... + 3037235.
It is an arithmetic number, because the mean of its divisors is an integer number (96140871792).
Almost surely, 22013210001220 is an apocalyptic number.
2013210001220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2013210001220 is an abundant number, since it is smaller than the sum of its proper divisors (2601551844796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2013210001220 is a wasteful number, since it uses less digits than its factorization.
2013210001220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5318972 (or 5318970 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 2013210001220 its reverse (221000123102), we get a palindrome (2234210124322).
The spelling of 2013210001220 in words is "two trillion, thirteen billion, two hundred ten million, one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •