Base | Representation |
---|---|
bin | 111101001101000… |
… | …0111010110101100 |
3 | 12022010100001102212 |
4 | 1322122013112230 |
5 | 13201214304340 |
6 | 535441105552 |
7 | 101614606034 |
oct | 17232072654 |
9 | 5263301385 |
10 | 2053666220 |
11 | 964271911 |
12 | 4939282b8 |
13 | 269617418 |
14 | 156a688c4 |
15 | c0463a65 |
hex | 7a6875ac |
2053666220 has 48 divisors (see below), whose sum is σ = 4425170400. Its totient is φ = 800110080.
The previous prime is 2053666217. The next prime is 2053666231. The reversal of 2053666220 is 226663502.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 604286 + ... + 607674.
It is an arithmetic number, because the mean of its divisors is an integer number (92191050).
Almost surely, 22053666220 is an apocalyptic number.
2053666220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2053666220, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2212585200).
2053666220 is an abundant number, since it is smaller than the sum of its proper divisors (2371504180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2053666220 is a wasteful number, since it uses less digits than its factorization.
2053666220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4178 (or 4176 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 32.
The square root of 2053666220 is about 45317.3942322371. The cubic root of 2053666220 is about 1271.0909302727.
The spelling of 2053666220 in words is "two billion, fifty-three million, six hundred sixty-six thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •