Base | Representation |
---|---|
bin | 101010010110… |
… | …100111101001 |
3 | 202220002001000 |
4 | 222112213221 |
5 | 10320241242 |
6 | 1033545213 |
7 | 163241244 |
oct | 52264751 |
9 | 22802030 |
10 | 11102697 |
11 | 62a3691 |
12 | 3875209 |
13 | 23b9758 |
14 | 169025b |
15 | e94a4c |
hex | a969e9 |
11102697 has 8 divisors (see below), whose sum is σ = 16448480. Its totient is φ = 7401780.
The previous prime is 11102687. The next prime is 11102699. The reversal of 11102697 is 79620111.
It is not a de Polignac number, because 11102697 - 26 = 11102633 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: 411211 = 11102697 / (1 + 1 + 1 + 0 + 2 + 6 + 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 11102697.
It is not an unprimeable number, because it can be changed into a prime (11102699) 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, 205579 + ... + 205632.
It is an arithmetic number, because the mean of its divisors is an integer number (2056060).
Almost surely, 211102697 is an apocalyptic number.
It is an amenable number.
11102697 is a deficient number, since it is larger than the sum of its proper divisors (5345783).
11102697 is an equidigital number, since it uses as much as digits as its factorization.
11102697 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411220 (or 411214 counting only the distinct ones).
The product of its (nonzero) digits is 756, while the sum is 27.
The square root of 11102697 is about 3332.0709776354. The cubic root of 11102697 is about 223.0879756376.
The spelling of 11102697 in words is "eleven million, one hundred two thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •