Base | Representation |
---|---|
bin | 101010100101… |
… | …011111101100 |
3 | 210000011121201 |
4 | 222211133230 |
5 | 10324214003 |
6 | 1035135244 |
7 | 163614010 |
oct | 52453754 |
9 | 23004551 |
10 | 11163628 |
11 | 6335443 |
12 | 38a4524 |
13 | 240b3c8 |
14 | 16a8540 |
15 | ea7b1d |
hex | aa57ec |
11163628 has 48 divisors (see below), whose sum is σ = 24192000. Its totient is φ = 4398336.
The previous prime is 11163623. The next prime is 11163641. The reversal of 11163628 is 82636111.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 11163596 and 11163605.
It is not an unprimeable number, because it can be changed into a prime (11163623) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22123 + ... + 22621.
It is an arithmetic number, because the mean of its divisors is an integer number (504000).
Almost surely, 211163628 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 11163628, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12096000).
11163628 is an abundant number, since it is smaller than the sum of its proper divisors (13028372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11163628 is a wasteful number, since it uses less digits than its factorization.
11163628 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 574 (or 572 counting only the distinct ones).
The product of its digits is 1728, while the sum is 28.
The square root of 11163628 is about 3341.2015802702. The cubic root of 11163628 is about 223.4953296089.
Adding to 11163628 its reverse (82636111), we get a palindrome (93799739).
The spelling of 11163628 in words is "eleven million, one hundred sixty-three thousand, six hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •