Base | Representation |
---|---|
bin | 110010000001011011001010… |
… | …111101101101011000011011 |
3 | 1001211221211000121002020020002 |
4 | 302001123022331231120123 |
5 | 212313440422310310021 |
6 | 2055522412243123215 |
7 | 64224330353364140 |
oct | 6201331275553033 |
9 | 1054854017066202 |
10 | 220000220010011 |
11 | 6410a629890141 |
12 | 2081162467350b |
13 | 959ac16014a4c |
14 | 3c480d31923c7 |
15 | 1a67a9d3d350b |
hex | c816caf6d61b |
220000220010011 has 8 divisors (see below), whose sum is σ = 262360510819584. Its totient is φ = 180372851188200.
The previous prime is 220000220010007. The next prime is 220000220010091. The reversal of 220000220010011 is 110010022000022.
It is a happy number.
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 220000220010011 - 22 = 220000220010007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220000220009974 and 220000220010001.
It is not an unprimeable number, because it can be changed into a prime (220000220010091) 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, 683230496765 + ... + 683230497086.
It is an arithmetic number, because the mean of its divisors is an integer number (32795063852448).
Almost surely, 2220000220010011 is an apocalyptic number.
220000220010011 is a deficient number, since it is larger than the sum of its proper divisors (42360290809573).
220000220010011 is a wasteful number, since it uses less digits than its factorization.
220000220010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1366460993881.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 220000220010011 its reverse (110010022000022), we get a palindrome (330010242010033).
The spelling of 220000220010011 in words is "two hundred twenty trillion, two hundred twenty million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •