Base | Representation |
---|---|
bin | 110010000001101110100010… |
… | …001101100000001101110011 |
3 | 1001212000210200120020002202020 |
4 | 302001232202031200031303 |
5 | 212314311012321333021 |
6 | 2055540131312522523 |
7 | 64225664523043122 |
oct | 6201564215401563 |
9 | 1055023616202666 |
10 | 220021011121011 |
11 | 64118428929601 |
12 | 20815667550443 |
13 | 959cb7a57c5a9 |
14 | 3c4910656bab9 |
15 | 1a683b881c7c6 |
hex | c81ba2360373 |
220021011121011 has 8 divisors (see below), whose sum is σ = 310617898053264. Its totient is φ = 138052399134720.
The previous prime is 220021011120971. The next prime is 220021011121039. The reversal of 220021011121011 is 110121110120022.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220021011121011 - 218 = 220021010858867 is a prime.
It is a super-2 number, since 2×2200210111210112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (220021011129011) 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, 2157068736430 + ... + 2157068736531.
It is an arithmetic number, because the mean of its divisors is an integer number (38827237256658).
Almost surely, 2220021011121011 is an apocalyptic number.
220021011121011 is a deficient number, since it is larger than the sum of its proper divisors (90596886932253).
220021011121011 is a wasteful number, since it uses less digits than its factorization.
220021011121011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4314137472981.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 220021011121011 its reverse (110121110120022), we get a palindrome (330142121241033).
The spelling of 220021011121011 in words is "two hundred twenty trillion, twenty-one billion, eleven million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •