Base | Representation |
---|---|
bin | 1010000011011111001000… |
… | …00000111000101110101001 |
3 | 2220021200211110022122101021 |
4 | 11001233210000320232221 |
5 | 10344222311130010441 |
6 | 115005112014452441 |
7 | 4441252650025261 |
oct | 501574400705651 |
9 | 86250743278337 |
10 | 22110022110121 |
11 | 705489808a660 |
12 | 25910a1804121 |
13 | c44c737b69ca |
14 | 5661b8c087a1 |
15 | 2851ebd773d1 |
hex | 141be4038ba9 |
22110022110121 has 8 divisors (see below), whose sum is σ = 24633216123264. Its totient is φ = 19672360097520.
The previous prime is 22110022110097. The next prime is 22110022110133. The reversal of 22110022110121 is 12101122001122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22110022110121 - 223 = 22110013721513 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22110022110095 and 22110022110104.
It is not an unprimeable number, because it can be changed into a prime (22110022114121) 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, 21382999590 + ... + 21383000623.
It is an arithmetic number, because the mean of its divisors is an integer number (3079152015408).
Almost surely, 222110022110121 is an apocalyptic number.
It is an amenable number.
22110022110121 is a deficient number, since it is larger than the sum of its proper divisors (2523194013143).
22110022110121 is a wasteful number, since it uses less digits than its factorization.
22110022110121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42766000271.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 22110022110121 its reverse (12101122001122), we get a palindrome (34211144111243).
The spelling of 22110022110121 in words is "twenty-two trillion, one hundred ten billion, twenty-two million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •