Base | Representation |
---|---|
bin | 101010111111… |
… | …110011000000 |
3 | 210012122101210 |
4 | 222333303000 |
5 | 10341140420 |
6 | 1041330120 |
7 | 164543052 |
oct | 52776300 |
9 | 23178353 |
10 | 11271360 |
11 | 63a9381 |
12 | 3936940 |
13 | 2448459 |
14 | 16d58d2 |
15 | ec99e0 |
hex | abfcc0 |
11271360 has 112 divisors (see below), whose sum is σ = 36576000. Its totient is φ = 2939904.
The previous prime is 11271319. The next prime is 11271361. The reversal of 11271360 is 6317211.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11271361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 56541 + ... + 56739.
Almost surely, 211271360 is an apocalyptic number.
11271360 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11271360, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18288000).
11271360 is an abundant number, since it is smaller than the sum of its proper divisors (25304640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11271360 is a wasteful number, since it uses less digits than its factorization.
11271360 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278 (or 268 counting only the distinct ones).
The product of its (nonzero) digits is 252, while the sum is 21.
The square root of 11271360 is about 3357.2846170678. The cubic root of 11271360 is about 224.2119592350.
Adding to 11271360 its reverse (6317211), we get a palindrome (17588571).
The spelling of 11271360 in words is "eleven million, two hundred seventy-one thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •