Base | Representation |
---|---|
bin | 11001001011101… |
… | …00100010100000 |
3 | 112201111011100012 |
4 | 30211310202200 |
5 | 413034203440 |
6 | 32543344052 |
7 | 5143343216 |
oct | 1445644240 |
9 | 481434305 |
10 | 211241120 |
11 | a9270642 |
12 | 5a8b2028 |
13 | 349c1a5c |
14 | 200aacb6 |
15 | 13829e65 |
hex | c9748a0 |
211241120 has 48 divisors (see below), whose sum is σ = 500266368. Its totient is φ = 84291840.
The previous prime is 211241119. The next prime is 211241123. The reversal of 211241120 is 21142112.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 211241095 and 211241104.
It is not an unprimeable number, because it can be changed into a prime (211241123) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 76565 + ... + 79275.
It is an arithmetic number, because the mean of its divisors is an integer number (10422216).
Almost surely, 2211241120 is an apocalyptic number.
211241120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211241120 is an abundant number, since it is smaller than the sum of its proper divisors (289025248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211241120 is a wasteful number, since it uses less digits than its factorization.
211241120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3213 (or 3205 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
The square root of 211241120 is about 14534.1363692515. The cubic root of 211241120 is about 595.5608674642.
Adding to 211241120 its reverse (21142112), we get a palindrome (232383232).
The spelling of 211241120 in words is "two hundred eleven million, two hundred forty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •