Base | Representation |
---|---|
bin | 1010000000100110101011… |
… | …11001011001111011000101 |
3 | 2212221020020111200002011202 |
4 | 11000103111321121323011 |
5 | 10341112012230120401 |
6 | 114451414141112245 |
7 | 4431146060451602 |
oct | 500232571317305 |
9 | 85836214602152 |
10 | 22011001020101 |
11 | 70168a4283075 |
12 | 2575a67858685 |
13 | c38822a3bb52 |
14 | 5614a3ba56a9 |
15 | 282853a5506b |
hex | 1404d5e59ec5 |
22011001020101 has 8 divisors (see below), whose sum is σ = 22725048518400. Its totient is φ = 21297204472320.
The previous prime is 22011001020077. The next prime is 22011001020103. The reversal of 22011001020101 is 10102010011022.
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 22011001020101 - 230 = 22009927278277 is a prime.
It is a super-3 number, since 3×220110010201013 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22011001020103) 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, 62559356 + ... + 62910213.
It is an arithmetic number, because the mean of its divisors is an integer number (2840631064800).
Almost surely, 222011001020101 is an apocalyptic number.
It is an amenable number.
22011001020101 is a deficient number, since it is larger than the sum of its proper divisors (714047498299).
22011001020101 is a wasteful number, since it uses less digits than its factorization.
22011001020101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 125475259.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 22011001020101 its reverse (10102010011022), we get a palindrome (32113011031123).
The spelling of 22011001020101 in words is "twenty-two trillion, eleven billion, one million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •