Base | Representation |
---|---|
bin | 101011001011… |
… | …101110100001 |
3 | 210022010102121 |
4 | 223023232201 |
5 | 10344221400 |
6 | 1042344241 |
7 | 165135400 |
oct | 53135641 |
9 | 23263377 |
10 | 11320225 |
11 | 6432064 |
12 | 395b081 |
13 | 2464777 |
14 | 1709637 |
15 | ed921a |
hex | acbba1 |
11320225 has 18 divisors (see below), whose sum is σ = 16330614. Its totient is φ = 7761600.
The previous prime is 11320213. The next prime is 11320229. The reversal of 11320225 is 52202311.
11320225 is digitally balanced in base 3, 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 3 ways, for example, as 3519376 + 7800849 = 1876^2 + 2793^2 .
It is not a de Polignac number, because 11320225 - 27 = 11320097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11320199 and 11320208.
It is not an unprimeable number, because it can be changed into a prime (11320229) 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 17 ways as a sum of consecutive naturals, for example, 3396 + ... + 5845.
Almost surely, 211320225 is an apocalyptic number.
It is an amenable number.
11320225 is a deficient number, since it is larger than the sum of its proper divisors (5010389).
11320225 is an equidigital number, since it uses as much as digits as its factorization.
11320225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9265 (or 9253 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 11320225 is about 3364.5542052403. The cubic root of 11320225 is about 224.5355026417.
Adding to 11320225 its reverse (52202311), we get a palindrome (63522536).
The spelling of 11320225 in words is "eleven million, three hundred twenty thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •