Base | Representation |
---|---|
bin | 110010100000010001100011… |
… | …101000000101010110101001 |
3 | 1002010110111001122200210012022 |
4 | 302200101203220011112221 |
5 | 213103204132213211014 |
6 | 2104224340010354225 |
7 | 64533440424164234 |
oct | 6240214350052651 |
9 | 1063414048623168 |
10 | 222120200132009 |
11 | 64857714349443 |
12 | 20ab447172b975 |
13 | 96c2aca5c373a |
14 | 3cbc96449241b |
15 | 1aa2cc973ba8e |
hex | ca0463a055a9 |
222120200132009 has 2 divisors, whose sum is σ = 222120200132010. Its totient is φ = 222120200132008.
The previous prime is 222120200132003. The next prime is 222120200132027. The reversal of 222120200132009 is 900231002021222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 127958018293609 + 94162181838400 = 11311853^2 + 9703720^2 .
It is a cyclic number.
It is not a de Polignac number, because 222120200132009 - 236 = 222051480655273 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (222120200132003) 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, 111060100066004 + 111060100066005.
It is an arithmetic number, because the mean of its divisors is an integer number (111060100066005).
Almost surely, 2222120200132009 is an apocalyptic number.
It is an amenable number.
222120200132009 is a deficient number, since it is larger than the sum of its proper divisors (1).
222120200132009 is an equidigital number, since it uses as much as digits as its factorization.
222120200132009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 26.
The spelling of 222120200132009 in words is "two hundred twenty-two trillion, one hundred twenty billion, two hundred million, one hundred thirty-two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •