Base | Representation |
---|---|
bin | 110010000100010101011011… |
… | …010011000001001111110001 |
3 | 1001212122221020020112220211020 |
4 | 302010111123103001033301 |
5 | 212330230012230323441 |
6 | 2100154325135010053 |
7 | 64244640323344644 |
oct | 6204253323011761 |
9 | 1055587206486736 |
10 | 220200210011121 |
11 | 64187425a41a9a |
12 | 20844338969929 |
13 | 95b3a38242a02 |
14 | 3c53a65bcda5b |
15 | 1a6cda5a2ee66 |
hex | c8455b4c13f1 |
220200210011121 has 8 divisors (see below), whose sum is σ = 293617039048320. Its totient is φ = 146791760490672.
The previous prime is 220200210011081. The next prime is 220200210011153. The reversal of 220200210011121 is 121110012002022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220200210011121 - 26 = 220200210011057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 220200210011121.
It is not an unprimeable number, because it can be changed into a prime (220200210011161) 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, 2094817870 + ... + 2094922983.
It is an arithmetic number, because the mean of its divisors is an integer number (36702129881040).
Almost surely, 2220200210011121 is an apocalyptic number.
It is an amenable number.
220200210011121 is a deficient number, since it is larger than the sum of its proper divisors (73416829037199).
220200210011121 is a wasteful number, since it uses less digits than its factorization.
220200210011121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4189758375.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 220200210011121 its reverse (121110012002022), we get a palindrome (341310222013143).
The spelling of 220200210011121 in words is "two hundred twenty trillion, two hundred billion, two hundred ten million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •