Base | Representation |
---|---|
bin | 1010000000010110001001… |
… | …00011110110001000100110 |
3 | 2212220101022120212202100202 |
4 | 11000023010203312020212 |
5 | 10340440320234034342 |
6 | 114443345014510502 |
7 | 4430413023063641 |
oct | 500130443661046 |
9 | 85811276782322 |
10 | 22002120221222 |
11 | 70130572a8469 |
12 | 25741a9665432 |
13 | c37a38b95c7b |
14 | 560ca053ca58 |
15 | 2824d4072332 |
hex | 1402c48f6226 |
22002120221222 has 8 divisors (see below), whose sum is σ = 33003254208000. Its totient is φ = 11001035485224.
The previous prime is 22002120221219. The next prime is 22002120221251. The reversal of 22002120221222 is 22212202120022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×220021202212223 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22002120221194 and 22002120221203.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11174822 + ... + 12995417.
It is an arithmetic number, because the mean of its divisors is an integer number (4125406776000).
Almost surely, 222002120221222 is an apocalyptic number.
22002120221222 is a deficient number, since it is larger than the sum of its proper divisors (11001133986778).
22002120221222 is a wasteful number, since it uses less digits than its factorization.
22002120221222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24625390.
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 22002120221222 its reverse (22212202120022), we get a palindrome (44214322341244).
The spelling of 22002120221222 in words is "twenty-two trillion, two billion, one hundred twenty million, two hundred twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •