Base | Representation |
---|---|
bin | 110010000001100101010100… |
… | …000100011111101010011011 |
3 | 1001211222212010112220022012112 |
4 | 302001211110010133222123 |
5 | 212314130223202431021 |
6 | 2055531413025502535 |
7 | 64225164260445062 |
oct | 6201452404375233 |
9 | 1054885115808175 |
10 | 220011110202011 |
11 | 64114208038617 |
12 | 208137637a1a4b |
13 | 959bc6027353b |
14 | 3c4884763b1d9 |
15 | 1a67ed94d1d5b |
hex | c8195411fa9b |
220011110202011 has 8 divisors (see below), whose sum is σ = 232953179209200. Its totient is φ = 207069067749888.
The previous prime is 220011110201999. The next prime is 220011110202017. The reversal of 220011110202011 is 110202011110022.
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 220011110202011 - 26 = 220011110201947 is a prime.
It is a super-2 number, since 2×2200111102020112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220011110202017) 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, 11897540 + ... + 24115838.
It is an arithmetic number, because the mean of its divisors is an integer number (29119147401150).
Almost surely, 2220011110202011 is an apocalyptic number.
220011110202011 is a deficient number, since it is larger than the sum of its proper divisors (12942069007189).
220011110202011 is a wasteful number, since it uses less digits than its factorization.
220011110202011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13277533.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 220011110202011 its reverse (110202011110022), we get a palindrome (330213121312033).
The spelling of 220011110202011 in words is "two hundred twenty trillion, eleven billion, one hundred ten million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •