Base | Representation |
---|---|
bin | 110010100000010001100100… |
… | …111000100010010101010011 |
3 | 1002010110111010010101021112111 |
4 | 302200101210320202111103 |
5 | 213103204203113102402 |
6 | 2104224342042410151 |
7 | 64533441101353606 |
oct | 6240214470422523 |
9 | 1063414103337474 |
10 | 222120221222227 |
11 | 64857725243879 |
12 | 20ab4478800957 |
13 | 96c2b01a99163 |
14 | 3cbc9671c233d |
15 | 1aa2ccb5059d7 |
hex | ca0464e22553 |
222120221222227 has 2 divisors, whose sum is σ = 222120221222228. Its totient is φ = 222120221222226.
The previous prime is 222120221222189. The next prime is 222120221222293. The reversal of 222120221222227 is 722222122021222.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 222120221222227 - 223 = 222120212833619 is a prime.
It is a super-2 number, since 2×2221202212222272 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (222120221232227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111060110611113 + 111060110611114.
It is an arithmetic number, because the mean of its divisors is an integer number (111060110611114).
Almost surely, 2222120221222227 is an apocalyptic number.
222120221222227 is a deficient number, since it is larger than the sum of its proper divisors (1).
222120221222227 is an equidigital number, since it uses as much as digits as its factorization.
222120221222227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14336, while the sum is 31.
Adding to 222120221222227 its reverse (722222122021222), we get a palindrome (944342343243449).
The spelling of 222120221222227 in words is "two hundred twenty-two trillion, one hundred twenty billion, two hundred twenty-one million, two hundred twenty-two thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •