Base | Representation |
---|---|
bin | 101010010101… |
… | …100000101000 |
3 | 202212211210200 |
4 | 222111200220 |
5 | 10320120102 |
6 | 1033512200 |
7 | 163222062 |
oct | 52254050 |
9 | 22784720 |
10 | 11098152 |
11 | 62a022a |
12 | 3872660 |
13 | 23b7670 |
14 | 168c732 |
15 | e9351c |
hex | a95828 |
11098152 has 96 divisors (see below), whose sum is σ = 33022080. Its totient is φ = 3346560.
The previous prime is 11098141. The next prime is 11098159. The reversal of 11098152 is 25189011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11098159) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 66373 + ... + 66539.
It is an arithmetic number, because the mean of its divisors is an integer number (343980).
Almost surely, 211098152 is an apocalyptic number.
11098152 is a gapful number since it is divisible by the number (12) 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 11098152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16511040).
11098152 is an abundant number, since it is smaller than the sum of its proper divisors (21923928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11098152 is a wasteful number, since it uses less digits than its factorization.
11098152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263 (or 256 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 27.
The square root of 11098152 is about 3331.3888995433. The cubic root of 11098152 is about 223.0575303853.
It can be divided in two parts, 1109 and 8152, that added together give a cube (9261 = 213).
The spelling of 11098152 in words is "eleven million, ninety-eight thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •