Base | Representation |
---|---|
bin | 1001000110101100000011… |
… | …10010101101011110111110 |
3 | 2121212222202022112021212120 |
4 | 10203112001302231132332 |
5 | 10111011022122333042 |
6 | 110325310224143410 |
7 | 4134320354061354 |
oct | 443260162553676 |
9 | 77788668467776 |
10 | 20021020121022 |
11 | 6419959a03088 |
12 | 22b425b167b66 |
13 | b22c8812207b |
14 | 4d3045c0b7d4 |
15 | 24abd5459dec |
hex | 123581cad7be |
20021020121022 has 8 divisors (see below), whose sum is σ = 40042040242056. Its totient is φ = 6673673373672.
The previous prime is 20021020121009. The next prime is 20021020121023. The reversal of 20021020121022 is 22012102012002.
It is a sphenic number, since it is the product of 3 distinct primes.
20021020121022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 20021020120992 and 20021020121010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20021020121023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1668418343413 + ... + 1668418343424.
It is an arithmetic number, because the mean of its divisors is an integer number (5005255030257).
Almost surely, 220021020121022 is an apocalyptic number.
20021020121022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20021020121022 is a wasteful number, since it uses less digits than its factorization.
20021020121022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3336836686842.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 20021020121022 its reverse (22012102012002), we get a palindrome (42033122133024).
The spelling of 20021020121022 in words is "twenty trillion, twenty-one billion, twenty million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •