Base | Representation |
---|---|
bin | 1001000110101100001110… |
… | …10001100101100010011110 |
3 | 2121212222222201121100201020 |
4 | 10203112013101211202132 |
5 | 10111011214144213042 |
6 | 110325323311425010 |
7 | 4134322551641544 |
oct | 443260721454236 |
9 | 77788881540636 |
10 | 20021112101022 |
11 | 64199a691700a |
12 | 22b4285b25166 |
13 | b22ca11b82c6 |
14 | 4d3054111d94 |
15 | 24abdd5783ec |
hex | 12358746589e |
20021112101022 has 16 divisors (see below), whose sum is σ = 41018863817232. Its totient is φ = 6510930764480.
The previous prime is 20021112100973. The next prime is 20021112101087. The reversal of 20021112101022 is 22010121112002.
It is a super-3 number, since 3×200211121010223 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20021112100992 and 20021112101010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40693317033 + ... + 40693317524.
It is an arithmetic number, because the mean of its divisors is an integer number (2563678988577).
Almost surely, 220021112101022 is an apocalyptic number.
20021112101022 is an abundant number, since it is smaller than the sum of its proper divisors (20997751716210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20021112101022 is a wasteful number, since it uses less digits than its factorization.
20021112101022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81386634603.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20021112101022 its reverse (22010121112002), we get a palindrome (42031233213024).
The spelling of 20021112101022 in words is "twenty trillion, twenty-one billion, one hundred twelve million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •