Base | Representation |
---|---|
bin | 101010100110… |
… | …101001100000 |
3 | 210000102002200 |
4 | 222212221200 |
5 | 10324341402 |
6 | 1035213200 |
7 | 163633536 |
oct | 52465140 |
9 | 23012080 |
10 | 11168352 |
11 | 6338a48 |
12 | 38a7200 |
13 | 24105c0 |
14 | 16aa156 |
15 | ea921c |
hex | aa6a60 |
11168352 has 144 divisors (see below), whose sum is σ = 36232560. Its totient is φ = 3234816.
The previous prime is 11168351. The next prime is 11168357. The reversal of 11168352 is 25386111.
It is a tau number, because it is divible by the number of its divisors (144).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11168351) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 71058 + ... + 71214.
It is an arithmetic number, because the mean of its divisors is an integer number (251615).
Almost surely, 211168352 is an apocalyptic number.
11168352 is a gapful number since it is divisible by the number (12) 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 11168352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18116280).
11168352 is an abundant number, since it is smaller than the sum of its proper divisors (25064208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11168352 is a wasteful number, since it uses less digits than its factorization.
11168352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 205 (or 194 counting only the distinct ones).
The product of its digits is 1440, while the sum is 27.
The square root of 11168352 is about 3341.9084368067. The cubic root of 11168352 is about 223.5268499190.
The spelling of 11168352 in words is "eleven million, one hundred sixty-eight thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •