Base | Representation |
---|---|
bin | 101010100010… |
… | …101011111101 |
3 | 202222120211200 |
4 | 222202223331 |
5 | 10323332000 |
6 | 1035010113 |
7 | 163535325 |
oct | 52425375 |
9 | 22876750 |
10 | 11152125 |
11 | 6327836 |
12 | 3899939 |
13 | 24060ba |
14 | 16a4285 |
15 | ea4500 |
hex | aa2afd |
11152125 has 48 divisors (see below), whose sum is σ = 21026304. Its totient is φ = 5676000.
The previous prime is 11152111. The next prime is 11152139. The reversal of 11152125 is 52125111.
It is an interprime number because it is at equal distance from previous prime (11152111) and next prime (11152139).
It is not a de Polignac number, because 11152125 - 211 = 11150077 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11152098 and 11152107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 25660 + ... + 26090.
It is an arithmetic number, because the mean of its divisors is an integer number (438048).
Almost surely, 211152125 is an apocalyptic number.
11152125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11152125 is a deficient number, since it is larger than the sum of its proper divisors (9874179).
11152125 is a wasteful number, since it uses less digits than its factorization.
11152125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 475 (or 462 counting only the distinct ones).
The product of its digits is 100, while the sum is 18.
The square root of 11152125 is about 3339.4797499012. The cubic root of 11152125 is about 223.4185400477.
Adding to 11152125 its reverse (52125111), we get a palindrome (63277236).
It can be divided in two parts, 1115 and 2125, that added together give a triangular number (3240 = T80).
The spelling of 11152125 in words is "eleven million, one hundred fifty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •