Base | Representation |
---|---|
bin | 110010100001011101111011… |
… | …111010100101000001011001 |
3 | 1002010202022202012111221212111 |
4 | 302201131323322211001121 |
5 | 213111030112233341441 |
6 | 2104330141553512321 |
7 | 64542402645520435 |
oct | 6241357372450131 |
9 | 1063668665457774 |
10 | 222202212012121 |
11 | 64889479976860 |
12 | 20b0833b2726a1 |
13 | 96ca76a4a2153 |
14 | 3cc29044d99c5 |
15 | 1aa4ec9668081 |
hex | ca177bea5059 |
222202212012121 has 32 divisors (see below), whose sum is σ = 244502796837888. Its totient is φ = 200257844754240.
The previous prime is 222202212012047. The next prime is 222202212012133. The reversal of 222202212012121 is 121210212202222.
It is a cyclic number.
It is not a de Polignac number, because 222202212012121 - 219 = 222202211487833 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 222202212012092 and 222202212012101.
It is not an unprimeable number, because it can be changed into a prime (222202212016121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2531684580 + ... + 2531772346.
It is an arithmetic number, because the mean of its divisors is an integer number (7640712401184).
Almost surely, 2222202212012121 is an apocalyptic number.
It is an amenable number.
222202212012121 is a deficient number, since it is larger than the sum of its proper divisors (22300584825767).
222202212012121 is a wasteful number, since it uses less digits than its factorization.
222202212012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91261.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 222202212012121 its reverse (121210212202222), we get a palindrome (343412424214343).
The spelling of 222202212012121 in words is "two hundred twenty-two trillion, two hundred two billion, two hundred twelve million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •