Base | Representation |
---|---|
bin | 1001000110101010011000… |
… | …01001011100101110010101 |
3 | 2121212220102121000002121212 |
4 | 10203111030021130232111 |
5 | 10111002201222041041 |
6 | 110325041033551205 |
7 | 4134256145114411 |
oct | 443251411345625 |
9 | 77786377002555 |
10 | 20020120112021 |
11 | 6419537974a97 |
12 | 22b4049875505 |
13 | b22b73824573 |
14 | 4d2d9c48bd41 |
15 | 24ab8142a8eb |
hex | 12354c25cb95 |
20020120112021 has 8 divisors (see below), whose sum is σ = 20348402865888. Its totient is φ = 19691840070000.
The previous prime is 20020120112017. The next prime is 20020120112023. The reversal of 20020120112021 is 12021102102002.
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 20020120112021 - 22 = 20020120112017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20020120111987 and 20020120112005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20020120112023) 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, 18722306 + ... + 19762716.
It is an arithmetic number, because the mean of its divisors is an integer number (2543550358236).
Almost surely, 220020120112021 is an apocalyptic number.
It is an amenable number.
20020120112021 is a deficient number, since it is larger than the sum of its proper divisors (328282753867).
20020120112021 is a wasteful number, since it uses less digits than its factorization.
20020120112021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1355923.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20020120112021 its reverse (12021102102002), we get a palindrome (32041222214023).
The spelling of 20020120112021 in words is "twenty trillion, twenty billion, one hundred twenty million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •