Base | Representation |
---|---|
bin | 101101010001… |
… | …100111110100 |
3 | 211022222202000 |
4 | 231101213310 |
5 | 11014244120 |
6 | 1102215300 |
7 | 202611336 |
oct | 55214764 |
9 | 24288660 |
10 | 11868660 |
11 | 6777111 |
12 | 3b84530 |
13 | 25c729b |
14 | 180d456 |
15 | 1096990 |
hex | b519f4 |
11868660 has 96 divisors (see below), whose sum is σ = 38169600. Its totient is φ = 3058560.
The previous prime is 11868653. The next prime is 11868679. The reversal of 11868660 is 6686811.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16386 + ... + 17094.
It is an arithmetic number, because the mean of its divisors is an integer number (397600).
Almost surely, 211868660 is an apocalyptic number.
11868660 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 11868660, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19084800).
11868660 is an abundant number, since it is smaller than the sum of its proper divisors (26300940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11868660 is a wasteful number, since it uses less digits than its factorization.
11868660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 758 (or 750 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 36.
The square root of 11868660 is about 3445.0921613217. The cubic root of 11868660 is about 228.1045227131.
The spelling of 11868660 in words is "eleven million, eight hundred sixty-eight thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •