Base | Representation |
---|---|
bin | 110010011110100010101111… |
… | …111111010010101011001011 |
3 | 1002010001002221212201121102022 |
4 | 302132202233333102223023 |
5 | 213044232000340400021 |
6 | 2104053541544355055 |
7 | 64522026145354022 |
oct | 6236425777225313 |
9 | 1063032855647368 |
10 | 222001222200011 |
11 | 6481120a410121 |
12 | 20a953a8175a8b |
13 | 96b48190a2047 |
14 | 3cb6cb8b9d8b9 |
15 | 1a9eb643761ab |
hex | c9e8affd2acb |
222001222200011 has 4 divisors (see below), whose sum is σ = 222001423306992. Its totient is φ = 222001021093032.
The previous prime is 222001222200007. The next prime is 222001222200031. The reversal of 222001222200011 is 110002222100222.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 222001222200011 - 22 = 222001222200007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (222001222200001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 98888456 + ... + 101108501.
It is an arithmetic number, because the mean of its divisors is an integer number (55500355826748).
Almost surely, 2222001222200011 is an apocalyptic number.
222001222200011 is a deficient number, since it is larger than the sum of its proper divisors (201106981).
222001222200011 is a wasteful number, since it uses less digits than its factorization.
222001222200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201106980.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 222001222200011 its reverse (110002222100222), we get a palindrome (332003444300233).
The spelling of 222001222200011 in words is "two hundred twenty-two trillion, one billion, two hundred twenty-two million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •