Base | Representation |
---|---|
bin | 101010011010… |
… | …111001011101 |
3 | 202220222002001 |
4 | 222122321131 |
5 | 10321321341 |
6 | 1034202301 |
7 | 163343320 |
oct | 52327135 |
9 | 22828061 |
10 | 11120221 |
11 | 6305872 |
12 | 3883391 |
13 | 23c4718 |
14 | 16967b7 |
15 | e99d31 |
hex | a9ae5d |
11120221 has 4 divisors (see below), whose sum is σ = 12708832. Its totient is φ = 9531612.
The previous prime is 11120209. The next prime is 11120243. The reversal of 11120221 is 12202111.
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, and also an emirpimes, since its reverse is a distinct semiprime: 12202111 = 283 ⋅43117.
It is a cyclic number.
It is not a de Polignac number, because 11120221 - 29 = 11119709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11120198 and 11120207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120251) 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, 794295 + ... + 794308.
It is an arithmetic number, because the mean of its divisors is an integer number (3177208).
Almost surely, 211120221 is an apocalyptic number.
It is an amenable number.
11120221 is a deficient number, since it is larger than the sum of its proper divisors (1588611).
11120221 is an equidigital number, since it uses as much as digits as its factorization.
11120221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1588610.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 11120221 is about 3334.6995366899. The cubic root of 11120221 is about 223.2052846327.
Adding to 11120221 its reverse (12202111), we get a palindrome (23322332).
The spelling of 11120221 in words is "eleven million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •