Base | Representation |
---|---|
bin | 11001001100100… |
… | …01100001001100 |
3 | 112201201012011111 |
4 | 30212101201030 |
5 | 413102003240 |
6 | 32550101404 |
7 | 5144346250 |
oct | 1446214114 |
9 | 481635144 |
10 | 211359820 |
11 | a9341841 |
12 | 5a94a864 |
13 | 34a33aa9 |
14 | 200dc260 |
15 | 138501ea |
hex | c99184c |
211359820 has 48 divisors (see below), whose sum is σ = 514237248. Its totient is φ = 71470080.
The previous prime is 211359803. The next prime is 211359847. The reversal of 211359820 is 28953112.
211359820 = T209 + T210 + ... + T1084.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 121 + ... + 20560.
It is an arithmetic number, because the mean of its divisors is an integer number (10713276).
Almost surely, 2211359820 is an apocalyptic number.
211359820 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 211359820, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (257118624).
211359820 is an abundant number, since it is smaller than the sum of its proper divisors (302877428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211359820 is a wasteful number, since it uses less digits than its factorization.
211359820 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20770 (or 20768 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 31.
The square root of 211359820 is about 14538.2192857310. The cubic root of 211359820 is about 595.6723985238.
The spelling of 211359820 in words is "two hundred eleven million, three hundred fifty-nine thousand, eight hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •