Base | Representation |
---|---|
bin | 1010000011011111010001… |
… | …01010000011100000001101 |
3 | 2220021201000212220102022210 |
4 | 11001233220222003200031 |
5 | 10344222441100323041 |
6 | 115005123440301033 |
7 | 4441254614126511 |
oct | 501575052034015 |
9 | 86251025812283 |
10 | 22110100011021 |
11 | 7054928057770 |
12 | 2591103911779 |
13 | c44c86990809 |
14 | 5661c52c6141 |
15 | 285203b14016 |
hex | 141be8a8380d |
22110100011021 has 16 divisors (see below), whose sum is σ = 32164191662400. Its totient is φ = 13398374699520.
The previous prime is 22110100011019. The next prime is 22110100011031. The reversal of 22110100011021 is 12011000101122.
It is not a de Polignac number, because 22110100011021 - 21 = 22110100011019 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 22110100010988 and 22110100011006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22110100011001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41881540 + ... + 42406173.
It is an arithmetic number, because the mean of its divisors is an integer number (2010261978900).
Almost surely, 222110100011021 is an apocalyptic number.
It is an amenable number.
22110100011021 is a deficient number, since it is larger than the sum of its proper divisors (10054091651379).
22110100011021 is a wasteful number, since it uses less digits than its factorization.
22110100011021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84295676.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 22110100011021 its reverse (12011000101122), we get a palindrome (34121100112143).
The spelling of 22110100011021 in words is "twenty-two trillion, one hundred ten billion, one hundred million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •