Base | Representation |
---|---|
bin | 11101011001010010101… |
… | …001000000110100111001 |
3 | 21011010000202002201121020 |
4 | 131121102221000310321 |
5 | 231044000401041441 |
6 | 4143552422533053 |
7 | 265641002102235 |
oct | 35312251006471 |
9 | 7133022081536 |
10 | 2020021112121 |
11 | 70976028a741 |
12 | 2875b0b97189 |
13 | 11864442168c |
14 | 6daab8ad5c5 |
15 | 3782aa18e66 |
hex | 1d652a40d39 |
2020021112121 has 8 divisors (see below), whose sum is σ = 2693952021024. Its totient is φ = 1346385472320.
The previous prime is 2020021112111. The next prime is 2020021112147. The reversal of 2020021112121 is 1212111200202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2020021112121 - 211 = 2020021110073 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2020021112121.
It is not an unprimeable number, because it can be changed into a prime (2020021112111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 73801311 + ... + 73828676.
It is an arithmetic number, because the mean of its divisors is an integer number (336744002628).
Almost surely, 22020021112121 is an apocalyptic number.
It is an amenable number.
2020021112121 is a deficient number, since it is larger than the sum of its proper divisors (673930908903).
2020021112121 is a wasteful number, since it uses less digits than its factorization.
2020021112121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147634551.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2020021112121 its reverse (1212111200202), we get a palindrome (3232132312323).
The spelling of 2020021112121 in words is "two trillion, twenty billion, twenty-one million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •