Base | Representation |
---|---|
bin | 101010010111… |
… | …011111001101 |
3 | 202220020220201 |
4 | 222113133031 |
5 | 10320400003 |
6 | 1034013501 |
7 | 163254514 |
oct | 52273715 |
9 | 22806821 |
10 | 11106253 |
11 | 62a6324 |
12 | 3877291 |
13 | 23bb262 |
14 | 169167b |
15 | e95b1d |
hex | a977cd |
11106253 has 8 divisors (see below), whose sum is σ = 12078072. Its totient is φ = 10169856.
The previous prime is 11106247. The next prime is 11106257. The reversal of 11106253 is 35260111.
It can be written as a sum of positive squares in 4 ways, for example, as 3052009 + 8054244 = 1747^2 + 2838^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11106253 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11106253.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11106257) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8200 + ... + 9457.
It is an arithmetic number, because the mean of its divisors is an integer number (1509759).
Almost surely, 211106253 is an apocalyptic number.
It is an amenable number.
11106253 is a deficient number, since it is larger than the sum of its proper divisors (971819).
11106253 is a wasteful number, since it uses less digits than its factorization.
11106253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17711.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 11106253 is about 3332.6045369951. The cubic root of 11106253 is about 223.1117901565. Note that the first 3 decimals are identical.
Adding to 11106253 its reverse (35260111), we get a palindrome (46366364).
The spelling of 11106253 in words is "eleven million, one hundred six thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •