Base | Representation |
---|---|
bin | 101010110100… |
… | …100110011101 |
3 | 210010022111022 |
4 | 222310212131 |
5 | 10333204001 |
6 | 1040333525 |
7 | 164262260 |
oct | 52644635 |
9 | 23108438 |
10 | 11225501 |
11 | 6377981 |
12 | 39142a5 |
13 | 2430611 |
14 | 16c2cd7 |
15 | ebb11b |
hex | ab499d |
11225501 has 12 divisors (see below), whose sum is σ = 13077792. Its totient is φ = 9437544.
The previous prime is 11225497. The next prime is 11225507. The reversal of 11225501 is 10552211.
11225501 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11225501 - 22 = 11225497 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11225501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11225507) 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 11 ways as a sum of consecutive naturals, for example, 80690 + ... + 80828.
It is an arithmetic number, because the mean of its divisors is an integer number (1089816).
Almost surely, 211225501 is an apocalyptic number.
It is an amenable number.
11225501 is a deficient number, since it is larger than the sum of its proper divisors (1852291).
11225501 is an frugal number, since it uses more digits than its factorization.
11225501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 368 (or 229 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 17.
The square root of 11225501 is about 3350.4478805079. The cubic root of 11225501 is about 223.9074673611.
Adding to 11225501 its reverse (10552211), we get a palindrome (21777712).
The spelling of 11225501 in words is "eleven million, two hundred twenty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •