Base | Representation |
---|---|
bin | 1001000110101010010111… |
… | …00111011100111100010101 |
3 | 2121212220101222020022122210 |
4 | 10203111023213130330111 |
5 | 10111002141431400041 |
6 | 110325040114544033 |
7 | 4134256006266042 |
oct | 443251347347425 |
9 | 77786358208583 |
10 | 20020111200021 |
11 | 64195329382a9 |
12 | 22b4046898019 |
13 | b22b71a23caa |
14 | 4d2d9b20c1c9 |
15 | 24ab8076a016 |
hex | 12354b9dcf15 |
20020111200021 has 8 divisors (see below), whose sum is σ = 28098401684320. Its totient is φ = 12644280757872.
The previous prime is 20020111199989. The next prime is 20020111200029. The reversal of 20020111200021 is 12000211102002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20020111200021 - 25 = 20020111199989 is a prime.
It is a super-2 number, since 2×200201112000212 (a number of 27 digits) contains 22 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 (20020111200029) 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, 175615010470 + ... + 175615010583.
It is an arithmetic number, because the mean of its divisors is an integer number (3512300210540).
Almost surely, 220020111200021 is an apocalyptic number.
It is an amenable number.
20020111200021 is a deficient number, since it is larger than the sum of its proper divisors (8078290484299).
20020111200021 is a wasteful number, since it uses less digits than its factorization.
20020111200021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 351230021075.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20020111200021 its reverse (12000211102002), we get a palindrome (32020322302023).
The spelling of 20020111200021 in words is "twenty trillion, twenty billion, one hundred eleven million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •