Base | Representation |
---|---|
bin | 1010000000100110111010… |
… | …00011011110110100010101 |
3 | 2212221020112212121212201020 |
4 | 11000103131003132310111 |
5 | 10341112234000231401 |
6 | 114451434110551353 |
7 | 4431152046234105 |
oct | 500233503366425 |
9 | 85836485555636 |
10 | 22011121102101 |
11 | 701695604049a |
12 | 2575a9bb08559 |
13 | c388418941a1 |
14 | 5614b5b03205 |
15 | 28285e374d36 |
hex | 1404dd0ded15 |
22011121102101 has 8 divisors (see below), whose sum is σ = 29359756960224. Its totient is φ = 14668282989360.
The previous prime is 22011121102081. The next prime is 22011121102189. The reversal of 22011121102101 is 10120112111022.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22011121102101 - 219 = 22011120577813 is a prime.
It is a super-2 number, since 2×220111211021012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22011121106101) 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, 1449427486 + ... + 1449442671.
It is an arithmetic number, because the mean of its divisors is an integer number (3669969620028).
Almost surely, 222011121102101 is an apocalyptic number.
It is an amenable number.
22011121102101 is a deficient number, since it is larger than the sum of its proper divisors (7348635858123).
22011121102101 is a wasteful number, since it uses less digits than its factorization.
22011121102101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2898872691.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 22011121102101 its reverse (10120112111022), we get a palindrome (32131233213123).
The spelling of 22011121102101 in words is "twenty-two trillion, eleven billion, one hundred twenty-one million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •