Base | Representation |
---|---|
bin | 110010100001110000011110… |
… | …101001100111010000001001 |
3 | 1002010211020010202220020120212 |
4 | 302201300132221213100021 |
5 | 213111341401230321301 |
6 | 2104343233352330505 |
7 | 64544006226611660 |
oct | 6241603651472011 |
9 | 1063736122806525 |
10 | 222222122120201 |
11 | 64896966688735 |
12 | 20b101770a3a35 |
13 | 96cc5c13650a8 |
14 | 3cc38728a1dd7 |
15 | 1aa57925794bb |
hex | ca1c1ea67409 |
222222122120201 has 8 divisors (see below), whose sum is σ = 254546654693760. Its totient is φ = 190042218328608.
The previous prime is 222222122120191. The next prime is 222222122120209. The reversal of 222222122120201 is 102021221222222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 222222122120201 - 242 = 217824075609097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (222222122120209) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36157192196 + ... + 36157198341.
It is an arithmetic number, because the mean of its divisors is an integer number (31818331836720).
Almost surely, 2222222122120201 is an apocalyptic number.
It is an amenable number.
222222122120201 is a deficient number, since it is larger than the sum of its proper divisors (32324532573559).
222222122120201 is an equidigital number, since it uses as much as digits as its factorization.
222222122120201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72314390983.
The product of its (nonzero) digits is 1024, while the sum is 23.
Adding to 222222122120201 its reverse (102021221222222), we get a palindrome (324243343342423).
The spelling of 222222122120201 in words is "two hundred twenty-two trillion, two hundred twenty-two billion, one hundred twenty-two million, one hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •