Base | Representation |
---|---|
bin | 101010010111… |
… | …001101100101 |
3 | 202220012100221 |
4 | 222113031211 |
5 | 10320331000 |
6 | 1034004341 |
7 | 163251313 |
oct | 52271545 |
9 | 22805327 |
10 | 11105125 |
11 | 62a5499 |
12 | 38766b1 |
13 | 23ba8a5 |
14 | 16910b3 |
15 | e9561a |
hex | a97365 |
11105125 has 16 divisors (see below), whose sum is σ = 14060592. Its totient is φ = 8755200.
The previous prime is 11105123. The next prime is 11105147. The reversal of 11105125 is 52150111.
It can be written as a sum of positive squares in 8 ways, for example, as 4124961 + 6980164 = 2031^2 + 2642^2 .
It is not a de Polignac number, because 11105125 - 21 = 11105123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11105099 and 11105108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11105123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8517 + ... + 9733.
It is an arithmetic number, because the mean of its divisors is an integer number (878787).
Almost surely, 211105125 is an apocalyptic number.
It is an amenable number.
11105125 is a deficient number, since it is larger than the sum of its proper divisors (2955467).
11105125 is an equidigital number, since it uses as much as digits as its factorization.
11105125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1305 (or 1295 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 16.
The square root of 11105125 is about 3332.4352956959. The cubic root of 11105125 is about 223.1042364953.
Adding to 11105125 its reverse (52150111), we get a palindrome (63255236).
The spelling of 11105125 in words is "eleven million, one hundred five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •