Base | Representation |
---|---|
bin | 10100100011001001… |
… | …00010111100010101 |
3 | 1001110212001101201121 |
4 | 22101210202330111 |
5 | 140043221224341 |
6 | 5022414323541 |
7 | 540250151053 |
oct | 122144427425 |
9 | 31425041647 |
10 | 11032211221 |
11 | 4751439639 |
12 | 217a7b95b1 |
13 | 106a7c4c45 |
14 | 7692971d3 |
15 | 4488034d1 |
hex | 291922f15 |
11032211221 has 2 divisors, whose sum is σ = 11032211222. Its totient is φ = 11032211220.
The previous prime is 11032211209. The next prime is 11032211287. The reversal of 11032211221 is 12211223011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10688664996 + 343546225 = 103386^2 + 18535^2 .
It is a cyclic number.
It is not a de Polignac number, because 11032211221 - 211 = 11032209173 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11032211195 and 11032211204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11032211321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5516105610 + 5516105611.
It is an arithmetic number, because the mean of its divisors is an integer number (5516105611).
Almost surely, 211032211221 is an apocalyptic number.
It is an amenable number.
11032211221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11032211221 is an equidigital number, since it uses as much as digits as its factorization.
11032211221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 11032211221 its reverse (12211223011), we get a palindrome (23243434232).
The spelling of 11032211221 in words is "eleven billion, thirty-two million, two hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •