Base | Representation |
---|---|
bin | 101010010111… |
… | …100011100000 |
3 | 202220021021220 |
4 | 222113203200 |
5 | 10320402103 |
6 | 1034015040 |
7 | 163255356 |
oct | 52274340 |
9 | 22807256 |
10 | 11106528 |
11 | 62a6554 |
12 | 3877480 |
13 | 23bb414 |
14 | 16917d6 |
15 | e95c53 |
hex | a978e0 |
11106528 has 24 divisors (see below), whose sum is σ = 29154888. Its totient is φ = 3702144.
The previous prime is 11106527. The next prime is 11106533. The reversal of 11106528 is 82560111.
It is a tau number, because it is divible by the number of its divisors (24).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 11106498 and 11106507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11106527) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 57751 + ... + 57942.
It is an arithmetic number, because the mean of its divisors is an integer number (1214787).
Almost surely, 211106528 is an apocalyptic number.
It is an amenable number.
11106528 is an abundant number, since it is smaller than the sum of its proper divisors (18048360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11106528 is a wasteful number, since it uses less digits than its factorization.
11106528 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115706 (or 115698 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 24.
The square root of 11106528 is about 3332.6457957605. The cubic root of 11106528 is about 223.1136316188.
Adding to 11106528 its reverse (82560111), we get a palindrome (93666639).
The spelling of 11106528 in words is "eleven million, one hundred six thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •