Base | Representation |
---|---|
bin | 110010000001100110010110… |
… | …010001111001100000110101 |
3 | 1001211222221222222002022002000 |
4 | 302001212112101321200311 |
5 | 212314140012034341041 |
6 | 2055532115150205513 |
7 | 64225233636253164 |
oct | 6201462621714065 |
9 | 1054887888068060 |
10 | 220012221012021 |
11 | 64114728066619 |
12 | 20813a137b3899 |
13 | 959c0a943a679 |
14 | 3c48910d913db |
15 | 1a68051ca0bb6 |
hex | c81996479835 |
220012221012021 has 64 divisors (see below), whose sum is σ = 334962017280000. Its totient is φ = 142676482777920.
The previous prime is 220012221011951. The next prime is 220012221012029. The reversal of 220012221012021 is 120210122210022.
It is a happy number.
It is not a de Polignac number, because 220012221012021 - 27 = 220012221011893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220012221011985 and 220012221012003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220012221012029) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 60662676 + ... + 64187106.
It is an arithmetic number, because the mean of its divisors is an integer number (5233781520000).
Almost surely, 2220012221012021 is an apocalyptic number.
It is an amenable number.
220012221012021 is a deficient number, since it is larger than the sum of its proper divisors (114949796267979).
220012221012021 is a wasteful number, since it uses less digits than its factorization.
220012221012021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3524911 (or 3524905 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 220012221012021 its reverse (120210122210022), we get a palindrome (340222343222043).
The spelling of 220012221012021 in words is "two hundred twenty trillion, twelve billion, two hundred twenty-one million, twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.636 sec. • engine limits •