Base | Representation |
---|---|
bin | 110010000001101110100010… |
… | …001101011111111110001011 |
3 | 1001212000210200120020001101012 |
4 | 302001232202031133332023 |
5 | 212314311012321320021 |
6 | 2055540131312514135 |
7 | 64225664523040163 |
oct | 6201564215377613 |
9 | 1055023616201335 |
10 | 220021011120011 |
11 | 64118428928882 |
12 | 2081566754b94b |
13 | 959cb7a57bcba |
14 | 3c4910656b5a3 |
15 | 1a683b881c35b |
hex | c81ba235ff8b |
220021011120011 has 4 divisors (see below), whose sum is σ = 220062345149592. Its totient is φ = 219979677090432.
The previous prime is 220021011120007. The next prime is 220021011120023. The reversal of 220021011120011 is 110021110120022.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 220021011120011 - 22 = 220021011120007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220021011120061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20667006806 + ... + 20667017451.
It is an arithmetic number, because the mean of its divisors is an integer number (55015586287398).
Almost surely, 2220021011120011 is an apocalyptic number.
220021011120011 is a deficient number, since it is larger than the sum of its proper divisors (41334029581).
220021011120011 is an equidigital number, since it uses as much as digits as its factorization.
220021011120011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41334029580.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 220021011120011 its reverse (110021110120022), we get a palindrome (330042121240033).
It can be divided in two parts, 220021011 and 120011, that added together give a palindrome (220141022).
The spelling of 220021011120011 in words is "two hundred twenty trillion, twenty-one billion, eleven million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •