Base | Representation |
---|---|
bin | 101010111110… |
… | …001011000100 |
3 | 210012022021102 |
4 | 222332023010 |
5 | 10340432313 |
6 | 1041235232 |
7 | 164514500 |
oct | 52761304 |
9 | 23168242 |
10 | 11264708 |
11 | 63a4384 |
12 | 3932b18 |
13 | 2445410 |
14 | 16d3300 |
15 | ec7a58 |
hex | abe2c4 |
11264708 has 36 divisors (see below), whose sum is σ = 24701292. Its totient is φ = 4455360.
The previous prime is 11264683. The next prime is 11264713. The reversal of 11264708 is 80746211.
11264708 is digitally balanced in base 2 and base 8, because in such bases it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 5466244 + 5798464 = 2338^2 + 2408^2 .
11264708 is strictly pandigital in base 8.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 338 + ... + 4758.
It is an arithmetic number, because the mean of its divisors is an integer number (686147).
Almost surely, 211264708 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 11264708, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12350646).
11264708 is an abundant number, since it is smaller than the sum of its proper divisors (13436584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11264708 is a wasteful number, since it uses less digits than its factorization.
11264708 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4452 (or 4443 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 29.
The square root of 11264708 is about 3356.2937892860. The cubic root of 11264708 is about 224.1678429540.
The spelling of 11264708 in words is "eleven million, two hundred sixty-four thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •