Base | Representation |
---|---|
bin | 101010111010… |
… | …101110101101 |
3 | 210011120221002 |
4 | 222322232231 |
5 | 10340004410 |
6 | 1041050045 |
7 | 164425412 |
oct | 52725655 |
9 | 23146832 |
10 | 11250605 |
11 | 6394823 |
12 | 3926925 |
13 | 243bb82 |
14 | 16cc109 |
15 | ec37a5 |
hex | ababad |
11250605 has 8 divisors (see below), whose sum is σ = 13830264. Its totient is φ = 8780800.
The previous prime is 11250599. The next prime is 11250643. The reversal of 11250605 is 50605211.
11250605 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 4 ways, for example, as 609961 + 10640644 = 781^2 + 3262^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-11250605 is a prime.
It is a super-2 number, since 2×112506052 = 253152225732050, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27236 + ... + 27645.
It is an arithmetic number, because the mean of its divisors is an integer number (1728783).
Almost surely, 211250605 is an apocalyptic number.
It is an amenable number.
11250605 is a deficient number, since it is larger than the sum of its proper divisors (2579659).
11250605 is an equidigital number, since it uses as much as digits as its factorization.
11250605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54927.
The product of its (nonzero) digits is 300, while the sum is 20.
The square root of 11250605 is about 3354.1921531123. The cubic root of 11250605 is about 224.0742539223.
Adding to 11250605 its reverse (50605211), we get a palindrome (61855816).
The spelling of 11250605 in words is "eleven million, two hundred fifty thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •