Base | Representation |
---|---|
bin | 101010000100… |
… | …001100010001 |
3 | 202202020111110 |
4 | 222010030101 |
5 | 10310332332 |
6 | 1032203533 |
7 | 162505215 |
oct | 52041421 |
9 | 22666443 |
10 | 11027217 |
11 | 6251a03 |
12 | 38395a9 |
13 | 23912a6 |
14 | 1670945 |
15 | e7c4cc |
hex | a84311 |
11027217 has 4 divisors (see below), whose sum is σ = 14702960. Its totient is φ = 7351476.
The previous prime is 11027213. The next prime is 11027231. The reversal of 11027217 is 71272011.
It is a happy number.
11027217 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 11027217 - 22 = 11027213 is a prime.
It is a Duffinian number.
It is a nialpdrome in base 16.
It is a junction number, because it is equal to n+sod(n) for n = 11027193 and 11027202.
It is not an unprimeable number, because it can be changed into a prime (11027213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1837867 + ... + 1837872.
It is an arithmetic number, because the mean of its divisors is an integer number (3675740).
Almost surely, 211027217 is an apocalyptic number.
It is an amenable number.
11027217 is a deficient number, since it is larger than the sum of its proper divisors (3675743).
11027217 is an equidigital number, since it uses as much as digits as its factorization.
11027217 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3675742.
The product of its (nonzero) digits is 196, while the sum is 21.
The square root of 11027217 is about 3320.7253725655. The cubic root of 11027217 is about 222.5812824266.
Adding to 11027217 its reverse (71272011), we get a palindrome (82299228).
The spelling of 11027217 in words is "eleven million, twenty-seven thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •