Base | Representation |
---|---|
bin | 101010100000… |
… | …111011011101 |
3 | 202222012222000 |
4 | 222200323131 |
5 | 10323114200 |
6 | 1034512513 |
7 | 163505331 |
oct | 52407335 |
9 | 22865860 |
10 | 11144925 |
11 | 6322390 |
12 | 3895739 |
13 | 2402a3c |
14 | 16a17c1 |
15 | ea2300 |
hex | aa0edd |
11144925 has 96 divisors (see below), whose sum is σ = 23808000. Its totient is φ = 5054400.
The previous prime is 11144899. The next prime is 11144929. The reversal of 11144925 is 52944111.
11144925 = 482 + 492 + ... + 3222.
It is not a de Polignac number, because 11144925 - 27 = 11144797 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11144929) 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 95 ways as a sum of consecutive naturals, for example, 141036 + ... + 141114.
It is an arithmetic number, because the mean of its divisors is an integer number (248000).
Almost surely, 211144925 is an apocalyptic number.
11144925 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11144925 is an abundant number, since it is smaller than the sum of its proper divisors (12663075).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11144925 is a wasteful number, since it uses less digits than its factorization.
11144925 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128 (or 117 counting only the distinct ones).
The product of its digits is 1440, while the sum is 27.
The square root of 11144925 is about 3338.4015636229. The cubic root of 11144925 is about 223.3704487707.
The spelling of 11144925 in words is "eleven million, one hundred forty-four thousand, nine hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •