Base | Representation |
---|---|
bin | 101011100101… |
… | …110011110100 |
3 | 210111112222110 |
4 | 223211303310 |
5 | 10411131220 |
6 | 1044531020 |
7 | 166062021 |
oct | 53456364 |
9 | 23445873 |
10 | 11427060 |
11 | 64a5357 |
12 | 39b0a70 |
13 | 24a1298 |
14 | 1736548 |
15 | 100abe0 |
hex | ae5cf4 |
11427060 has 72 divisors (see below), whose sum is σ = 34040160. Its totient is φ = 2863616.
The previous prime is 11427049. The next prime is 11427071. The reversal of 11427060 is 6072411.
It is an interprime number because it is at equal distance from previous prime (11427049) and next prime (11427071).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17011 + ... + 17669.
It is an arithmetic number, because the mean of its divisors is an integer number (472780).
Almost surely, 211427060 is an apocalyptic number.
11427060 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 11427060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17020080).
11427060 is an abundant number, since it is smaller than the sum of its proper divisors (22613100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11427060 is a wasteful number, since it uses less digits than its factorization.
11427060 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 705 (or 686 counting only the distinct ones).
The product of its (nonzero) digits is 336, while the sum is 21.
The square root of 11427060 is about 3380.3934682223. The cubic root of 11427060 is about 225.2396458988.
Adding to 11427060 its reverse (6072411), we get a palindrome (17499471).
The spelling of 11427060 in words is "eleven million, four hundred twenty-seven thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •