Base | Representation |
---|---|
bin | 11101011001011001001… |
… | …100100101110110101001 |
3 | 21011010022102001210111221 |
4 | 131121121030211312221 |
5 | 231044212030231441 |
6 | 4144011352222041 |
7 | 265643506022626 |
oct | 35313114456651 |
9 | 7133272053457 |
10 | 2020131102121 |
11 | 709807384870 |
12 | 28762199a921 |
13 | 118661152312 |
14 | 6dabc34134d |
15 | 378354e38d1 |
hex | 1d659325da9 |
2020131102121 has 8 divisors (see below), whose sum is σ = 2210957822304. Its totient is φ = 1830500788320.
The previous prime is 2020131102109. The next prime is 2020131102137. The reversal of 2020131102121 is 1212011310202.
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 2020131102121 - 27 = 2020131101993 is a prime.
It is a super-2 number, since 2×20201311021212 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2020131102095 and 2020131102104.
It is not an unprimeable number, because it can be changed into a prime (2020131102161) 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, 299098060 + ... + 299104813.
It is an arithmetic number, because the mean of its divisors is an integer number (276369727788).
Almost surely, 22020131102121 is an apocalyptic number.
It is an amenable number.
2020131102121 is a deficient number, since it is larger than the sum of its proper divisors (190826720183).
2020131102121 is a wasteful number, since it uses less digits than its factorization.
2020131102121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 598203191.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 2020131102121 its reverse (1212011310202), we get a palindrome (3232142412323).
The spelling of 2020131102121 in words is "two trillion, twenty billion, one hundred thirty-one million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •