Base | Representation |
---|---|
bin | 110010000001101111011101… |
… | …010001110010011110011001 |
3 | 1001212000220020121221001112020 |
4 | 302001233131101302132121 |
5 | 212314320030014200441 |
6 | 2055540413513005053 |
7 | 64226031215163054 |
oct | 6201573521623631 |
9 | 1055026217831466 |
10 | 220022002100121 |
11 | 64118897250901 |
12 | 208158a33b3789 |
13 | 959cca797b770 |
14 | 3c4919c00ba9b |
15 | 1a6842581ae66 |
hex | c81bdd472799 |
220022002100121 has 8 divisors (see below), whose sum is σ = 315929028656640. Its totient is φ = 135398155138512.
The previous prime is 220022002100101. The next prime is 220022002100161. The reversal of 220022002100121 is 121001200220022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220022002100121 - 29 = 220022002099609 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 220022002100121.
It is not an unprimeable number, because it can be changed into a prime (220022002100101) 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, 2820794898681 + ... + 2820794898758.
It is an arithmetic number, because the mean of its divisors is an integer number (39491128582080).
Almost surely, 2220022002100121 is an apocalyptic number.
It is an amenable number.
220022002100121 is a deficient number, since it is larger than the sum of its proper divisors (95907026556519).
220022002100121 is a wasteful number, since it uses less digits than its factorization.
220022002100121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5641589797455.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 220022002100121 its reverse (121001200220022), we get a palindrome (341023202320143).
The spelling of 220022002100121 in words is "two hundred twenty trillion, twenty-two billion, two million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •