Base | Representation |
---|---|
bin | 101011100001… |
… | …110100000000 |
3 | 210110201112002 |
4 | 223201310000 |
5 | 10410120223 |
6 | 1044323132 |
7 | 165663212 |
oct | 53416400 |
9 | 23421462 |
10 | 11410688 |
11 | 6494023 |
12 | 39a34a8 |
13 | 24969b3 |
14 | 17305b2 |
15 | 1005e28 |
hex | ae1d00 |
11410688 has 54 divisors (see below), whose sum is σ = 24034374. Its totient is φ = 5404672.
The previous prime is 11410673. The next prime is 11410727. The reversal of 11410688 is 88601411.
It can be written as a sum of positive squares in 3 ways, for example, as 2930944 + 8479744 = 1712^2 + 2912^2 .
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a self number, because there is not a number n which added to its sum of digits gives 11410688.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 215270 + ... + 215322.
It is an arithmetic number, because the mean of its divisors is an integer number (445081).
Almost surely, 211410688 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 11410688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12017187).
11410688 is an abundant number, since it is smaller than the sum of its proper divisors (12623686).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11410688 is an frugal number, since it uses more digits than its factorization.
11410688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127 (or 84 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 29.
The square root of 11410688 is about 3377.9709886262. The cubic root of 11410688 is about 225.1320245736.
The spelling of 11410688 in words is "eleven million, four hundred ten thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •