Base | Representation |
---|---|
bin | 101011111101… |
… | …000000000100 |
3 | 210200101021200 |
4 | 223331000010 |
5 | 10422201202 |
6 | 1050542500 |
7 | 166635663 |
oct | 53750004 |
9 | 23611250 |
10 | 11522052 |
11 | 655a763 |
12 | 3a37a30 |
13 | 25055a9 |
14 | 175cdda |
15 | 1028e1c |
hex | afd004 |
11522052 has 18 divisors (see below), whose sum is σ = 29125278. Its totient is φ = 3840672.
The previous prime is 11522047. The next prime is 11522053. The reversal of 11522052 is 25022511.
It can be written as a sum of positive squares in only one way, i.e., 10342656 + 1179396 = 3216^2 + 1086^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (11522053) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 159993 + ... + 160064.
It is an arithmetic number, because the mean of its divisors is an integer number (1618071).
Almost surely, 211522052 is an apocalyptic number.
11522052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11522052 is an abundant number, since it is smaller than the sum of its proper divisors (17603226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11522052 is a wasteful number, since it uses less digits than its factorization.
11522052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 320067 (or 320062 counting only the distinct ones).
The product of its (nonzero) digits is 200, while the sum is 18.
The square root of 11522052 is about 3394.4148243843. The cubic root of 11522052 is about 225.8620558987.
Adding to 11522052 its reverse (25022511), we get a palindrome (36544563).
The spelling of 11522052 in words is "eleven million, five hundred twenty-two thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •