Base | Representation |
---|---|
bin | 101010101110… |
… | …111011001100 |
3 | 210002010121020 |
4 | 222232323030 |
5 | 10331433002 |
6 | 1040034140 |
7 | 164134425 |
oct | 52567314 |
9 | 23063536 |
10 | 11202252 |
11 | 6361466 |
12 | 3902950 |
13 | 2422b69 |
14 | 16b864c |
15 | eb42bc |
hex | aaeecc |
11202252 has 48 divisors (see below), whose sum is σ = 28032480. Its totient is φ = 3469312.
The previous prime is 11202251. The next prime is 11202259. The reversal of 11202252 is 25220211.
It is a zygodrome in base 16.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11202251) 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, 17848 + ... + 18464.
It is an arithmetic number, because the mean of its divisors is an integer number (584010).
Almost surely, 211202252 is an apocalyptic number.
11202252 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 11202252, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14016240).
11202252 is an abundant number, since it is smaller than the sum of its proper divisors (16830228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11202252 is a wasteful number, since it uses less digits than its factorization.
11202252 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 730 (or 728 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 15.
The square root of 11202252 is about 3346.9765460786. The cubic root of 11202252 is about 223.7527831702.
Adding to 11202252 its reverse (25220211), we get a palindrome (36422463).
The spelling of 11202252 in words is "eleven million, two hundred two thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •