Base | Representation |
---|---|
bin | 101010011101… |
… | …111011000000 |
3 | 202221121001211 |
4 | 222131323000 |
5 | 10322220413 |
6 | 1034335504 |
7 | 163424404 |
oct | 52357300 |
9 | 22847054 |
10 | 11132608 |
11 | 6314103 |
12 | 388a594 |
13 | 23ca256 |
14 | 169b104 |
15 | e9d83d |
hex | a9dec0 |
11132608 has 28 divisors (see below), whose sum is σ = 22567392. Its totient is φ = 5446400.
The previous prime is 11132599. The next prime is 11132609. The reversal of 11132608 is 80623111.
11132608 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (11132609) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1158 + ... + 4858.
Almost surely, 211132608 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 11132608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11283696).
11132608 is an abundant number, since it is smaller than the sum of its proper divisors (11434784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11132608 is an equidigital number, since it uses as much as digits as its factorization.
11132608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3760 (or 3750 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 22.
The square root of 11132608 is about 3336.5563085313. The cubic root of 11132608 is about 223.2881312444.
Adding to 11132608 its reverse (80623111), we get a palindrome (91755719).
It can be divided in two parts, 1113 and 2608, that added together give a square (3721 = 612).
The spelling of 11132608 in words is "eleven million, one hundred thirty-two thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •