Base | Representation |
---|---|
bin | 110010000001100101010100… |
… | …000100011111011110000110 |
3 | 1001211222212010112220021010022 |
4 | 302001211110010133132012 |
5 | 212314130223202414342 |
6 | 2055531413025455142 |
7 | 64225164260442554 |
oct | 6201452404373606 |
9 | 1054885115807108 |
10 | 220011110201222 |
11 | 64114208037a6a |
12 | 208137637a14b2 |
13 | 959bc60273082 |
14 | 3c4884763abd4 |
15 | 1a67ed94d19d2 |
hex | c8195411f786 |
220011110201222 has 4 divisors (see below), whose sum is σ = 330016665301836. Its totient is φ = 110005555100610.
The previous prime is 220011110201221. The next prime is 220011110201237. The reversal of 220011110201222 is 222102011110022.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×2200111102012222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 220011110201222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220011110201221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55002777550304 + ... + 55002777550307.
It is an arithmetic number, because the mean of its divisors is an integer number (82504166325459).
Almost surely, 2220011110201222 is an apocalyptic number.
220011110201222 is a deficient number, since it is larger than the sum of its proper divisors (110005555100614).
220011110201222 is a wasteful number, since it uses less digits than its factorization.
220011110201222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110005555100613.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 220011110201222 its reverse (222102011110022), we get a palindrome (442113121311244).
The spelling of 220011110201222 in words is "two hundred twenty trillion, eleven billion, one hundred ten million, two hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •