Base | Representation |
---|---|
bin | 101100001011… |
… | …001101110000 |
3 | 210210100010222 |
4 | 230023031300 |
5 | 10431032042 |
6 | 1052112212 |
7 | 200300504 |
oct | 54131560 |
9 | 23710128 |
10 | 11580272 |
11 | 659a480 |
12 | 3a65668 |
13 | 2525c42 |
14 | 1776304 |
15 | 103b2d2 |
hex | b0b370 |
11580272 has 40 divisors (see below), whose sum is σ = 25772160. Its totient is φ = 4985280.
The previous prime is 11580271. The next prime is 11580299. The reversal of 11580272 is 27208511.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11580271) 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, 1613 + ... + 5075.
It is an arithmetic number, because the mean of its divisors is an integer number (644304).
Almost surely, 211580272 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 11580272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12886080).
11580272 is an abundant number, since it is smaller than the sum of its proper divisors (14191888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11580272 is a wasteful number, since it uses less digits than its factorization.
11580272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3501 (or 3495 counting only the distinct ones).
The product of its (nonzero) digits is 1120, while the sum is 26.
The square root of 11580272 is about 3402.9798706428. The cubic root of 11580272 is about 226.2418378668.
Adding to 11580272 its reverse (27208511), we get a palindrome (38788783).
The spelling of 11580272 in words is "eleven million, five hundred eighty thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •