Base | Representation |
---|---|
bin | 1001000110101110010010… |
… | …10100101001110000111101 |
3 | 2121220002211221200200010221 |
4 | 10203113021110221300331 |
5 | 10111021001332413041 |
6 | 110330025254101341 |
7 | 4134362165432023 |
oct | 443271124516075 |
9 | 77802757620127 |
10 | 20022220201021 |
11 | 641a415363a35 |
12 | 22b453504a851 |
13 | b23119943a8c |
14 | 4d311b35c713 |
15 | 24ac559ae2d1 |
hex | 1235c9529c3d |
20022220201021 has 8 divisors (see below), whose sum is σ = 20274236095680. Its totient is φ = 19770461076192.
The previous prime is 20022220201019. The next prime is 20022220201043. The reversal of 20022220201021 is 12010202222002.
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 20022220201021 - 21 = 20022220201019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20022220200986 and 20022220201004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20022220208021) 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, 64035520 + ... + 64347433.
It is an arithmetic number, because the mean of its divisors is an integer number (2534279511960).
Almost surely, 220022220201021 is an apocalyptic number.
It is an amenable number.
20022220201021 is a deficient number, since it is larger than the sum of its proper divisors (252015894659).
20022220201021 is a wasteful number, since it uses less digits than its factorization.
20022220201021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128384915.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 20022220201021 its reverse (12010202222002), we get a palindrome (32032422423023).
The spelling of 20022220201021 in words is "twenty trillion, twenty-two billion, two hundred twenty million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •