Base | Representation |
---|---|
bin | 101011010110… |
… | …111010000100 |
3 | 210101110020201 |
4 | 223112322010 |
5 | 10402203040 |
6 | 1043340244 |
7 | 165416041 |
oct | 53267204 |
9 | 23343221 |
10 | 11366020 |
11 | 6463506 |
12 | 3981684 |
13 | 247c573 |
14 | 171c1c8 |
15 | ee7a9a |
hex | ad6e84 |
11366020 has 48 divisors (see below), whose sum is σ = 24893568. Its totient is φ = 4355840.
The previous prime is 11365997. The next prime is 11366021. The reversal of 11366020 is 2066311.
11366020 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (11366021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 67977 + ... + 68143.
It is an arithmetic number, because the mean of its divisors is an integer number (518616).
Almost surely, 211366020 is an apocalyptic number.
11366020 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 11366020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12446784).
11366020 is an abundant number, since it is smaller than the sum of its proper divisors (13527548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11366020 is a wasteful number, since it uses less digits than its factorization.
11366020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 300 (or 298 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
The square root of 11366020 is about 3371.3528441858. The cubic root of 11366020 is about 224.8378749775.
The spelling of 11366020 in words is "eleven million, three hundred sixty-six thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •