Base | Representation |
---|---|
bin | 101010111000… |
… | …001111010101 |
3 | 210011001221022 |
4 | 222320033111 |
5 | 10334143110 |
6 | 1040530525 |
7 | 164353601 |
oct | 52701725 |
9 | 23131838 |
10 | 11240405 |
11 | 63880a0 |
12 | 3920a45 |
13 | 2437337 |
14 | 16c8501 |
15 | ec0755 |
hex | ab83d5 |
11240405 has 8 divisors (see below), whose sum is σ = 14714784. Its totient is φ = 8174800.
The previous prime is 11240401. The next prime is 11240423. The reversal of 11240405 is 50404211.
11240405 = T78 + T79 + ... + T407.
11240405 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11240405 - 22 = 11240401 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11240401) 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, 102131 + ... + 102240.
It is an arithmetic number, because the mean of its divisors is an integer number (1839348).
Almost surely, 211240405 is an apocalyptic number.
It is an amenable number.
11240405 is a deficient number, since it is larger than the sum of its proper divisors (3474379).
11240405 is a wasteful number, since it uses less digits than its factorization.
11240405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204387.
The product of its (nonzero) digits is 160, while the sum is 17.
The square root of 11240405 is about 3352.6713229901. The cubic root of 11240405 is about 224.0065168704.
Adding to 11240405 its reverse (50404211), we get a palindrome (61644616).
The spelling of 11240405 in words is "eleven million, two hundred forty thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •