Base | Representation |
---|---|
bin | 101010001100… |
… | …101110110101 |
3 | 202211000111000 |
4 | 222030232311 |
5 | 10312442242 |
6 | 1033033513 |
7 | 163012206 |
oct | 52145665 |
9 | 22730430 |
10 | 11062197 |
11 | 6276213 |
12 | 3855899 |
13 | 23a41a3 |
14 | 167d5ad |
15 | e87a4c |
hex | a8cbb5 |
11062197 has 8 divisors (see below), whose sum is σ = 16388480. Its totient is φ = 7374780.
The previous prime is 11062151. The next prime is 11062217. The reversal of 11062197 is 79126011.
It is not a de Polignac number, because 11062197 - 27 = 11062069 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 409711 = 11062197 / (1 + 1 + 0 + 6 + 2 + 1 + 9 + 7).
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 11062197.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11062697) 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, 204829 + ... + 204882.
It is an arithmetic number, because the mean of its divisors is an integer number (2048560).
Almost surely, 211062197 is an apocalyptic number.
It is an amenable number.
11062197 is a deficient number, since it is larger than the sum of its proper divisors (5326283).
11062197 is an equidigital number, since it uses as much as digits as its factorization.
11062197 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 409720 (or 409714 counting only the distinct ones).
The product of its (nonzero) digits is 756, while the sum is 27.
The square root of 11062197 is about 3325.9881238513. The cubic root of 11062197 is about 222.8163878348.
The spelling of 11062197 in words is "eleven million, sixty-two thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •