Base | Representation |
---|---|
bin | 10001101000000010011… |
… | …001110100111010000011 |
3 | 11021210101002012011102122 |
4 | 101220002121310322003 |
5 | 124321040100232321 |
6 | 2324232143434455 |
7 | 153336121332521 |
oct | 21500231647203 |
9 | 4253332164378 |
10 | 1211221102211 |
11 | 42774881028a |
12 | 1768ab5b5a2b |
13 | 8a2aa277663 |
14 | 428a2911311 |
15 | 2178eda18ab |
hex | 11a02674e83 |
1211221102211 has 2 divisors, whose sum is σ = 1211221102212. Its totient is φ = 1211221102210.
The previous prime is 1211221102207. The next prime is 1211221102213. The reversal of 1211221102211 is 1122011221121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1211221102211 - 22 = 1211221102207 is a prime.
It is a Sophie Germain prime.
Together with 1211221102213, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1211221102211.
It is not a weakly prime, because it can be changed into another prime (1211221102213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605610551105 + 605610551106.
It is an arithmetic number, because the mean of its divisors is an integer number (605610551106).
Almost surely, 21211221102211 is an apocalyptic number.
1211221102211 is a deficient number, since it is larger than the sum of its proper divisors (1).
1211221102211 is an equidigital number, since it uses as much as digits as its factorization.
1211221102211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 1211221102211 its reverse (1122011221121), we get a palindrome (2333232323332).
The spelling of 1211221102211 in words is "one trillion, two hundred eleven billion, two hundred twenty-one million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •