Base | Representation |
---|---|
bin | 101010110011… |
… | …110001110001 |
3 | 210010010212102 |
4 | 222303301301 |
5 | 10333102004 |
6 | 1040310145 |
7 | 164246402 |
oct | 52636161 |
9 | 23103772 |
10 | 11222129 |
11 | 6375396 |
12 | 3912355 |
13 | 242bc19 |
14 | 16c19a9 |
15 | eba11e |
hex | ab3c71 |
11222129 has 2 divisors, whose sum is σ = 11222130. Its totient is φ = 11222128.
The previous prime is 11222089. The next prime is 11222147. The reversal of 11222129 is 92122211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9394225 + 1827904 = 3065^2 + 1352^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11222129 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is equal to p740234 and since 11222129 and 740234 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11222129.
It is not a weakly prime, because it can be changed into another prime (11222429) 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, 5611064 + 5611065.
It is an arithmetic number, because the mean of its divisors is an integer number (5611065).
Almost surely, 211222129 is an apocalyptic number.
It is an amenable number.
11222129 is a deficient number, since it is larger than the sum of its proper divisors (1).
11222129 is an equidigital number, since it uses as much as digits as its factorization.
11222129 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 144, while the sum is 20.
The square root of 11222129 is about 3349.9446264080. The cubic root of 11222129 is about 223.8850454490.
The spelling of 11222129 in words is "eleven million, two hundred twenty-two thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •