Base | Representation |
---|---|
bin | 101011000010… |
… | …011011110000 |
3 | 210020012012210 |
4 | 223002123300 |
5 | 10342012120 |
6 | 1041452120 |
7 | 164616411 |
oct | 53023360 |
9 | 23205183 |
10 | 11282160 |
11 | 64064aa |
12 | 3941040 |
13 | 2450346 |
14 | 16d9808 |
15 | eccce0 |
hex | ac26f0 |
11282160 has 80 divisors (see below), whose sum is σ = 36203040. Its totient is φ = 2903040.
The previous prime is 11282149. The next prime is 11282207. The reversal of 11282160 is 6128211.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
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, 6150 + ... + 7770.
It is an arithmetic number, because the mean of its divisors is an integer number (452538).
Almost surely, 211282160 is an apocalyptic number.
11282160 is a gapful number since it is divisible by the number (10) 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 11282160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18101520).
11282160 is an abundant number, since it is smaller than the sum of its proper divisors (24920880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11282160 is a wasteful number, since it uses less digits than its factorization.
11282160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1666 (or 1660 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 21.
The square root of 11282160 is about 3358.8926746772. The cubic root of 11282160 is about 224.2835482347.
The spelling of 11282160 in words is "eleven million, two hundred eighty-two thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •