Base | Representation |
---|---|
bin | 110010100000010010100000… |
… | …100011000000100101110101 |
3 | 1002010110120200212220211022012 |
4 | 302200102200203000211311 |
5 | 213103213230341240312 |
6 | 2104225025241214005 |
7 | 64533504644546165 |
oct | 6240224043004565 |
9 | 1063416625824265 |
10 | 222121222211957 |
11 | 64858099283212 |
12 | 20ab46b7a91305 |
13 | 96c2c31291983 |
14 | 3cbca2010a5a5 |
15 | 1aa2d39330322 |
hex | ca04a08c0975 |
222121222211957 has 2 divisors, whose sum is σ = 222121222211958. Its totient is φ = 222121222211956.
The previous prime is 222121222211939. The next prime is 222121222212011. The reversal of 222121222211957 is 759112222121222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 180719384262481 + 41401837949476 = 13443191^2 + 6434426^2 .
It is a cyclic number.
It is not a de Polignac number, because 222121222211957 - 26 = 222121222211893 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222121222211857) 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, 111060611105978 + 111060611105979.
It is an arithmetic number, because the mean of its divisors is an integer number (111060611105979).
Almost surely, 2222121222211957 is an apocalyptic number.
It is an amenable number.
222121222211957 is a deficient number, since it is larger than the sum of its proper divisors (1).
222121222211957 is an equidigital number, since it uses as much as digits as its factorization.
222121222211957 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 80640, while the sum is 41.
The spelling of 222121222211957 in words is "two hundred twenty-two trillion, one hundred twenty-one billion, two hundred twenty-two million, two hundred eleven thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •