Base | Representation |
---|---|
bin | 11101011001100100000… |
… | …100000010111000111011 |
3 | 21011010210010010001110111 |
4 | 131121210010002320323 |
5 | 231100100213124011 |
6 | 4144041423525151 |
7 | 265651151436031 |
oct | 35314404027073 |
9 | 7133703101414 |
10 | 2020313411131 |
11 | 7098a0284274 |
12 | 287672a597b7 |
13 | 11868cb54182 |
14 | 6dad863a551 |
15 | 37846506121 |
hex | 1d664102e3b |
2020313411131 has 4 divisors (see below), whose sum is σ = 2067297443992. Its totient is φ = 1973329378272.
The previous prime is 2020313411117. The next prime is 2020313411141. The reversal of 2020313411131 is 1311143130202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2020313411131 - 235 = 1985953672763 is a prime.
It is a super-2 number, since 2×20203134111312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2020313411141) 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 3 ways as a sum of consecutive naturals, for example, 23492016366 + ... + 23492016451.
It is an arithmetic number, because the mean of its divisors is an integer number (516824360998).
Almost surely, 22020313411131 is an apocalyptic number.
2020313411131 is a deficient number, since it is larger than the sum of its proper divisors (46984032861).
2020313411131 is an equidigital number, since it uses as much as digits as its factorization.
2020313411131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46984032860.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 2020313411131 its reverse (1311143130202), we get a palindrome (3331456541333).
The spelling of 2020313411131 in words is "two trillion, twenty billion, three hundred thirteen million, four hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •