Base | Representation |
---|---|
bin | 1010000011100000111100… |
… | …10111011100001101000001 |
3 | 2220021210100200110112120012 |
4 | 11001300132113130031001 |
5 | 10344231312240213441 |
6 | 115005353105554305 |
7 | 4441316135225402 |
oct | 501603627341501 |
9 | 86253320415505 |
10 | 22111001101121 |
11 | 705524a764029 |
12 | 2591315645995 |
13 | c4509b57941a |
14 | 56626cc479a9 |
15 | 285257ca89eb |
hex | 141c1e5dc341 |
22111001101121 has 8 divisors (see below), whose sum is σ = 23310711334080. Its totient is φ = 20914888201488.
The previous prime is 22111001101097. The next prime is 22111001101171. The reversal of 22111001101121 is 12110110011122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22111001101121 - 214 = 22111001084737 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 22111001101096 and 22111001101105.
It is not an unprimeable number, because it can be changed into a prime (22111001101171) 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, 899320706 + ... + 899345291.
It is an arithmetic number, because the mean of its divisors is an integer number (2913838916760).
Almost surely, 222111001101121 is an apocalyptic number.
It is an amenable number.
22111001101121 is a deficient number, since it is larger than the sum of its proper divisors (1199710232959).
22111001101121 is a wasteful number, since it uses less digits than its factorization.
22111001101121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1798666663.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 22111001101121 its reverse (12110110011122), we get a palindrome (34221111112243).
The spelling of 22111001101121 in words is "twenty-two trillion, one hundred eleven billion, one million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •