Base | Representation |
---|---|
bin | 1010001101001001100001… |
… | …0101000000110010000001 |
3 | 1110201201101111101020101221 |
4 | 2203102120111000302001 |
5 | 2432321112104102314 |
6 | 35510505543355041 |
7 | 2235456044111434 |
oct | 243223025006201 |
9 | 43651344336357 |
10 | 11221010222209 |
11 | 3636892815017 |
12 | 1312859752a81 |
13 | 6351a14c6a78 |
14 | 2ab157b8b81b |
15 | 146d3e3e9824 |
hex | a3498540c81 |
11221010222209 has 2 divisors, whose sum is σ = 11221010222210. Its totient is φ = 11221010222208.
The previous prime is 11221010222167. The next prime is 11221010222221. The reversal of 11221010222209 is 90222201012211.
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., 8085082791184 + 3135927431025 = 2843428^2 + 1770855^2 .
It is an emirp because it is prime and its reverse (90222201012211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11221010222209 - 225 = 11220976667777 is a prime.
It is a super-2 number, since 2×112210102222092 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11221010222269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5610505111104 + 5610505111105.
It is an arithmetic number, because the mean of its divisors is an integer number (5610505111105).
Almost surely, 211221010222209 is an apocalyptic number.
It is an amenable number.
11221010222209 is a deficient number, since it is larger than the sum of its proper divisors (1).
11221010222209 is an equidigital number, since it uses as much as digits as its factorization.
11221010222209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 25.
The spelling of 11221010222209 in words is "eleven trillion, two hundred twenty-one billion, ten million, two hundred twenty-two thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •