Base | Representation |
---|---|
bin | 100000010100101011000… |
… | …010101010101000011011 |
3 | 21212100100122200221211122 |
4 | 200110223002222220123 |
5 | 242343024333224402 |
6 | 4420225305515455 |
7 | 316322623163063 |
oct | 40245302525033 |
9 | 7770318627748 |
10 | 2221220211227 |
11 | 7870179a1836 |
12 | 2ba5a21a2b8b |
13 | 1315c9caac44 |
14 | 79716d283a3 |
15 | 3cba439bca2 |
hex | 2052b0aaa1b |
2221220211227 has 2 divisors, whose sum is σ = 2221220211228. Its totient is φ = 2221220211226.
The previous prime is 2221220211211. The next prime is 2221220211229. The reversal of 2221220211227 is 7221120221222.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2221220211227 - 24 = 2221220211211 is a prime.
Together with 2221220211229, 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 = 2221220211196 and 2221220211205.
It is not a weakly prime, because it can be changed into another prime (2221220211229) 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, 1110610105613 + 1110610105614.
It is an arithmetic number, because the mean of its divisors is an integer number (1110610105614).
Almost surely, 22221220211227 is an apocalyptic number.
2221220211227 is a deficient number, since it is larger than the sum of its proper divisors (1).
2221220211227 is an equidigital number, since it uses as much as digits as its factorization.
2221220211227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1792, while the sum is 26.
Adding to 2221220211227 its reverse (7221120221222), we get a palindrome (9442340432449).
The spelling of 2221220211227 in words is "two trillion, two hundred twenty-one billion, two hundred twenty million, two hundred eleven thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •