Base | Representation |
---|---|
bin | 101010010101… |
… | …000010110000 |
3 | 202212202011212 |
4 | 222111002300 |
5 | 10320034430 |
6 | 1033455252 |
7 | 163213361 |
oct | 52250260 |
9 | 22782155 |
10 | 11096240 |
11 | 6299851 |
12 | 3871528 |
13 | 23b682c |
14 | 168bb68 |
15 | e92b95 |
hex | a950b0 |
11096240 has 80 divisors (see below), whose sum is σ = 28123200. Its totient is φ = 4055040.
The previous prime is 11096237. The next prime is 11096249. The reversal of 11096240 is 4269011.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is not an unprimeable number, because it can be changed into a prime (11096249) 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, 55661 + ... + 55859.
It is an arithmetic number, because the mean of its divisors is an integer number (351540).
Almost surely, 211096240 is an apocalyptic number.
11096240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11096240 is the 2720-th pentagonal number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11096240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14061600).
11096240 is an abundant number, since it is smaller than the sum of its proper divisors (17026960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11096240 is a wasteful number, since it uses less digits than its factorization.
11096240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270 (or 264 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 23.
The square root of 11096240 is about 3331.1019197857. The cubic root of 11096240 is about 223.0447201297.
The spelling of 11096240 in words is "eleven million, ninety-six thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •