Base | Representation |
---|---|
bin | 10100100101110111… |
… | …011010110010100001 |
3 | 2010001220002112020212 |
4 | 110211313122302201 |
5 | 330240142333441 |
6 | 14053544343505 |
7 | 1411623633344 |
oct | 244567326241 |
9 | 63056075225 |
10 | 22110121121 |
11 | 9416650280 |
12 | 4350774b95 |
13 | 21148ca50a |
14 | 10da64845b |
15 | 896131eeb |
hex | 525ddaca1 |
22110121121 has 8 divisors (see below), whose sum is σ = 24368794464. Its totient is φ = 19892891520.
The previous prime is 22110121091. The next prime is 22110121151. The reversal of 22110121121 is 12112101122.
It is an interprime number because it is at equal distance from previous prime (22110121091) and next prime (22110121151).
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 22110121121 - 26 = 22110121057 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 = 22110121096 and 22110121105.
It is not an unprimeable number, because it can be changed into a prime (22110121151) 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, 10359815 + ... + 10361948.
It is an arithmetic number, because the mean of its divisors is an integer number (3046099308).
Almost surely, 222110121121 is an apocalyptic number.
It is an amenable number.
22110121121 is a deficient number, since it is larger than the sum of its proper divisors (2258673343).
22110121121 is a wasteful number, since it uses less digits than its factorization.
22110121121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20721871.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 22110121121 its reverse (12112101122), we get a palindrome (34222222243).
The spelling of 22110121121 in words is "twenty-two billion, one hundred ten million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •