Search a number
-
+
11061221 is a prime number
BaseRepresentation
bin101010001100…
…011111100101
3202210222010212
4222030133211
510312424341
61033025205
7163006313
oct52143745
922728125
1011061221
116275506
123855205
1323a3902
14167d0b3
15e875eb
hexa8c7e5

11061221 has 2 divisors, whose sum is σ = 11061222. Its totient is φ = 11061220.

The previous prime is 11061199. The next prime is 11061223. The reversal of 11061221 is 12216011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6604900 + 4456321 = 2570^2 + 2111^2 .

It is a cyclic number.

It is not a de Polignac number, because 11061221 - 210 = 11060197 is a prime.

It is a super-2 number, since 2×110612212 = 244701220021682, which contains 22 as substring.

Together with 11061223, it forms a pair of twin primes.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 11061196 and 11061205.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (11061223) 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 as a sum of consecutive naturals, namely, 5530610 + 5530611.

It is an arithmetic number, because the mean of its divisors is an integer number (5530611).

Almost surely, 211061221 is an apocalyptic number.

It is an amenable number.

11061221 is a deficient number, since it is larger than the sum of its proper divisors (1).

11061221 is an equidigital number, since it uses as much as digits as its factorization.

11061221 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 24, while the sum is 14.

The square root of 11061221 is about 3325.8413973008. The cubic root of 11061221 is about 222.8098347305.

Adding to 11061221 its reverse (12216011), we get a palindrome (23277232).

The spelling of 11061221 in words is "eleven million, sixty-one thousand, two hundred twenty-one".