Base | Representation |
---|---|
bin | 101010010010… |
… | …110111100000 |
3 | 202212021221210 |
4 | 222102313200 |
5 | 10314243303 |
6 | 1033350120 |
7 | 163145400 |
oct | 52226740 |
9 | 22767853 |
10 | 11087328 |
11 | 629308a |
12 | 3868340 |
13 | 23b2765 |
14 | 1688800 |
15 | e90203 |
hex | a92de0 |
11087328 has 72 divisors (see below), whose sum is σ = 33870312. Its totient is φ = 3166464.
The previous prime is 11087327. The next prime is 11087333. The reversal of 11087328 is 82378011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11087295 and 11087304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11087327) 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 11 ways as a sum of consecutive naturals, for example, 3526 + ... + 5882.
It is an arithmetic number, because the mean of its divisors is an integer number (470421).
Almost surely, 211087328 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11087328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16935156).
11087328 is an abundant number, since it is smaller than the sum of its proper divisors (22782984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11087328 is a wasteful number, since it uses less digits than its factorization.
11087328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2384 (or 2369 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 30.
The square root of 11087328 is about 3329.7639555981. The cubic root of 11087328 is about 222.9849909798.
The spelling of 11087328 in words is "eleven million, eighty-seven thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •