Base | Representation |
---|---|
bin | 101001111111… |
… | …001111011100 |
3 | 202201012200110 |
4 | 221333033130 |
5 | 10304210230 |
6 | 1031530020 |
7 | 162362130 |
oct | 51771734 |
9 | 22635613 |
10 | 11006940 |
11 | 623874a |
12 | 3829910 |
13 | 2384ca9 |
14 | 16673c0 |
15 | e764b0 |
hex | a7f3dc |
11006940 has 96 divisors (see below), whose sum is σ = 35804160. Its totient is φ = 2474496.
The previous prime is 11006927. The next prime is 11006959. The reversal of 11006940 is 4960011.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 30481 + ... + 30839.
It is an arithmetic number, because the mean of its divisors is an integer number (372960).
Almost surely, 211006940 is an apocalyptic number.
11006940 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 11006940, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17902080).
11006940 is an abundant number, since it is smaller than the sum of its proper divisors (24797220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11006940 is a wasteful number, since it uses less digits than its factorization.
11006940 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 451 (or 449 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
The square root of 11006940 is about 3317.6708697519. The cubic root of 11006940 is about 222.4447701995. Note that the first 3 decimals are identical.
Adding to 11006940 its reverse (4960011), we get a palindrome (15966951).
The spelling of 11006940 in words is "eleven million, six thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •