Base | Representation |
---|---|
bin | 101010111101… |
… | …001011000000 |
3 | 210012002122120 |
4 | 222331023000 |
5 | 10340314413 |
6 | 1041204240 |
7 | 164466522 |
oct | 52751300 |
9 | 23162576 |
10 | 11260608 |
11 | 63a1297 |
12 | 3930680 |
13 | 24435a8 |
14 | 16d1a12 |
15 | ec6723 |
hex | abd2c0 |
11260608 has 56 divisors (see below), whose sum is σ = 30041088. Its totient is φ = 3722496.
The previous prime is 11260603. The next prime is 11260619. The reversal of 11260608 is 80606211.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (11260603) 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 7 ways as a sum of consecutive naturals, for example, 42685 + ... + 42947.
It is an arithmetic number, because the mean of its divisors is an integer number (536448).
Almost surely, 211260608 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 11260608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15020544).
11260608 is an abundant number, since it is smaller than the sum of its proper divisors (18780480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11260608 is a wasteful number, since it uses less digits than its factorization.
11260608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 501 (or 491 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 24.
The square root of 11260608 is about 3355.6829409228. The cubic root of 11260608 is about 224.1406429685.
Adding to 11260608 its reverse (80606211), we get a palindrome (91866819).
The spelling of 11260608 in words is "eleven million, two hundred sixty thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •