Base | Representation |
---|---|
bin | 110010011110100010101111… |
… | …111110111010110001101010 |
3 | 1002010001002221212112122010210 |
4 | 302132202233332322301222 |
5 | 213044232000324231442 |
6 | 2104053541542321550 |
7 | 64522026144465441 |
oct | 6236425776726152 |
9 | 1063032855478123 |
10 | 222001222102122 |
11 | 6481120a353621 |
12 | 20a953a81292b6 |
13 | 96b4819069618 |
14 | 3cb6cb8b75d58 |
15 | 1a9eb6435719c |
hex | c9e8affbac6a |
222001222102122 has 64 divisors (see below), whose sum is σ = 456950736418176. Its totient is φ = 71862424058880.
The previous prime is 222001222102103. The next prime is 222001222102123. The reversal of 222001222102122 is 221201222100222.
It is a super-2 number, since 2×2220012221021222 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (222001222102123) 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 31 ways as a sum of consecutive naturals, for example, 189617358 + ... + 190784550.
It is an arithmetic number, because the mean of its divisors is an integer number (7139855256534).
Almost surely, 2222001222102122 is an apocalyptic number.
222001222102122 is an abundant number, since it is smaller than the sum of its proper divisors (234949514316054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
222001222102122 is a wasteful number, since it uses less digits than its factorization.
222001222102122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1171495.
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 222001222102122 its reverse (221201222100222), we get a palindrome (443202444202344).
The spelling of 222001222102122 in words is "two hundred twenty-two trillion, one billion, two hundred twenty-two million, one hundred two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •