Base | Representation |
---|---|
bin | 1010000110000110110000… |
… | …10111110010011001011001 |
3 | 2220121022010122022001001012 |
4 | 11003003120113302121121 |
5 | 10402211120400200441 |
6 | 115114314321303305 |
7 | 4450620134564234 |
oct | 503033027623131 |
9 | 86538118261035 |
10 | 22200021100121 |
11 | 7089a81180937 |
12 | 25a661a194b35 |
13 | c505b7344347 |
14 | 56a6b592241b |
15 | 2877180a49eb |
hex | 1430d85f2659 |
22200021100121 has 8 divisors (see below), whose sum is σ = 22338291129984. Its totient is φ = 22061776358160.
The previous prime is 22200021100069. The next prime is 22200021100129. The reversal of 22200021100121 is 12100112000222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22200021100121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22200021100096 and 22200021100105.
It is not an unprimeable number, because it can be changed into a prime (22200021100129) 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, 4559201 + ... + 8073806.
It is an arithmetic number, because the mean of its divisors is an integer number (2792286391248).
Almost surely, 222200021100121 is an apocalyptic number.
It is an amenable number.
22200021100121 is a deficient number, since it is larger than the sum of its proper divisors (138270029863).
22200021100121 is a wasteful number, since it uses less digits than its factorization.
22200021100121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12643951.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 22200021100121 its reverse (12100112000222), we get a palindrome (34300133100343).
The spelling of 22200021100121 in words is "twenty-two trillion, two hundred billion, twenty-one million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •