Base | Representation |
---|---|
bin | 1001001100011110101110… |
… | …01011101010001100000101 |
3 | 2122121000102001012112220120 |
4 | 10212033113023222030011 |
5 | 10122241100413020401 |
6 | 111000541032252153 |
7 | 4154563655362653 |
oct | 446172713521405 |
9 | 78530361175816 |
10 | 20220021220101 |
11 | 649629893122a |
12 | 2326938241059 |
13 | b389804ca3c1 |
14 | 4dc923389dd3 |
15 | 250e80d68836 |
hex | 1263d72ea305 |
20220021220101 has 8 divisors (see below), whose sum is σ = 26972946379584. Its totient is φ = 13473555103680.
The previous prime is 20220021220081. The next prime is 20220021220121. The reversal of 20220021220101 is 10102212002202.
It is an interprime number because it is at equal distance from previous prime (20220021220081) and next prime (20220021220121).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20220021220101 - 27 = 20220021219973 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20220021220121) 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, 1614753460 + ... + 1614765981.
It is an arithmetic number, because the mean of its divisors is an integer number (3371618297448).
Almost surely, 220220021220101 is an apocalyptic number.
It is an amenable number.
20220021220101 is a deficient number, since it is larger than the sum of its proper divisors (6752925159483).
20220021220101 is a wasteful number, since it uses less digits than its factorization.
20220021220101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3229521531.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 20220021220101 its reverse (10102212002202), we get a palindrome (30322233222303).
The spelling of 20220021220101 in words is "twenty trillion, two hundred twenty billion, twenty-one million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •