Base | Representation |
---|---|
bin | 101010111110… |
… | …010001100101 |
3 | 210012022211212 |
4 | 222332101211 |
5 | 10340441000 |
6 | 1041241205 |
7 | 164515634 |
oct | 52762145 |
9 | 23168755 |
10 | 11265125 |
11 | 63a4723 |
12 | 3933205 |
13 | 2445671 |
14 | 16d351b |
15 | ec7c35 |
hex | abe465 |
11265125 has 8 divisors (see below), whose sum is σ = 14059032. Its totient is φ = 9012000.
The previous prime is 11265113. The next prime is 11265127. The reversal of 11265125 is 52156211.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 229441 + 11035684 = 479^2 + 3322^2 .
It is a de Polignac number, because none of the positive numbers 2k-11265125 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11265125.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11265127) 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 7 ways as a sum of consecutive naturals, for example, 44936 + ... + 45185.
It is an arithmetic number, because the mean of its divisors is an integer number (1757379).
Almost surely, 211265125 is an apocalyptic number.
It is an amenable number.
11265125 is a deficient number, since it is larger than the sum of its proper divisors (2793907).
11265125 is an frugal number, since it uses more digits than its factorization.
11265125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90136 (or 90126 counting only the distinct ones).
The product of its digits is 600, while the sum is 23.
The square root of 11265125 is about 3356.3559108056. The cubic root of 11265125 is about 224.1706090218.
The spelling of 11265125 in words is "eleven million, two hundred sixty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •