Base | Representation |
---|---|
bin | 101011001110… |
… | …001001001101 |
3 | 210022122000021 |
4 | 223032021031 |
5 | 10400031000 |
6 | 1042502141 |
7 | 165206302 |
oct | 53161115 |
9 | 23278007 |
10 | 11330125 |
11 | 6439544 |
12 | 3964951 |
13 | 2469121 |
14 | 170d0a9 |
15 | edc11a |
hex | ace24d |
11330125 has 8 divisors (see below), whose sum is σ = 14140152. Its totient is φ = 9064000.
The previous prime is 11330119. The next prime is 11330129. The reversal of 11330125 is 52103311.
11330125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 169 + 11329956 = 13^2 + 3366^2 .
It is not a de Polignac number, because 11330125 - 23 = 11330117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11330099 and 11330108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11330129) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45196 + ... + 45445.
It is an arithmetic number, because the mean of its divisors is an integer number (1767519).
Almost surely, 211330125 is an apocalyptic number.
It is an amenable number.
11330125 is a deficient number, since it is larger than the sum of its proper divisors (2810027).
11330125 is an frugal number, since it uses more digits than its factorization.
11330125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90656 (or 90646 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 11330125 is about 3366.0251038874. The cubic root of 11330125 is about 224.6009387317.
Adding to 11330125 its reverse (52103311), we get a palindrome (63433436).
The spelling of 11330125 in words is "eleven million, three hundred thirty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •