Base | Representation |
---|---|
bin | 1001000110101010100011… |
… | …00100100111011110010110 |
3 | 2121212220122221020210010120 |
4 | 10203111101210213132112 |
5 | 10111002343021320042 |
6 | 110325054044332410 |
7 | 4134261331506021 |
oct | 443252144473626 |
9 | 77786587223116 |
10 | 20020211120022 |
11 | 6419584284713 |
12 | 22b4074244106 |
13 | b22b8963a259 |
14 | 4d2daa5bc1b8 |
15 | 24ab89405dec |
hex | 123551927796 |
20020211120022 has 32 divisors (see below), whose sum is σ = 40063707758592. Its totient is φ = 6669523927584.
The previous prime is 20020211120017. The next prime is 20020211120027. The reversal of 20020211120022 is 22002111202002.
It is an interprime number because it is at equal distance from previous prime (20020211120017) and next prime (20020211120027).
It is a junction number, because it is equal to n+sod(n) for n = 20020211119983 and 20020211120010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20020211120027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 71814688 + ... + 72092924.
It is an arithmetic number, because the mean of its divisors is an integer number (1251990867456).
Almost surely, 220020211120022 is an apocalyptic number.
20020211120022 is an abundant number, since it is smaller than the sum of its proper divisors (20043496638570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20020211120022 is a wasteful number, since it uses less digits than its factorization.
20020211120022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 285172.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 20020211120022 its reverse (22002111202002), we get a palindrome (42022322322024).
The spelling of 20020211120022 in words is "twenty trillion, twenty billion, two hundred eleven million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •