Base | Representation |
---|---|
bin | 101010000010… |
… | …100101110101 |
3 | 202201220111122 |
4 | 222002211311 |
5 | 10310130121 |
6 | 1032113325 |
7 | 162450131 |
oct | 52024565 |
9 | 22656448 |
10 | 11020661 |
11 | 6247a93 |
12 | 3835845 |
13 | 238b302 |
14 | 166c3c1 |
15 | e7a5ab |
hex | a82975 |
11020661 has 8 divisors (see below), whose sum is σ = 11284920. Its totient is φ = 10758592.
The previous prime is 11020651. The next prime is 11020693. The reversal of 11020661 is 16602011.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 4900 + 11015761 = 70^2 + 3319^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11020661 - 210 = 11019637 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13871 + ... + 14643.
It is an arithmetic number, because the mean of its divisors is an integer number (1410615).
Almost surely, 211020661 is an apocalyptic number.
It is an amenable number.
11020661 is a deficient number, since it is larger than the sum of its proper divisors (264259).
11020661 is an equidigital number, since it uses as much as digits as its factorization.
11020661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1095.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 11020661 is about 3319.7380920790. The cubic root of 11020661 is about 222.5371633417.
Adding to 11020661 its reverse (16602011), we get a palindrome (27622672).
The spelling of 11020661 in words is "eleven million, twenty thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •