Base | Representation |
---|---|
bin | 11101111000101010101… |
… | …101110010010100001011 |
3 | 21021022222122121000120201 |
4 | 131320222231302110023 |
5 | 232122000004410011 |
6 | 4211243430233031 |
7 | 301242605404051 |
oct | 35705255622413 |
9 | 7238878530521 |
10 | 2053711013131 |
11 | 721a79365a38 |
12 | 2920337b5777 |
13 | 11b8830b274b |
14 | 71585dca1d1 |
15 | 3864d561cc1 |
hex | 1de2ab7250b |
2053711013131 has 4 divisors (see below), whose sum is σ = 2053726327264. Its totient is φ = 2053695699000.
The previous prime is 2053711013087. The next prime is 2053711013149. The reversal of 2053711013131 is 1313101173502.
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 2053711013131 - 237 = 1916272059659 is a prime.
It is a super-2 number, since 2×20537110131312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2053711013131.
It is not an unprimeable number, because it can be changed into a prime (2053711019131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7454115 + ... + 7724716.
It is an arithmetic number, because the mean of its divisors is an integer number (513431581816).
Almost surely, 22053711013131 is an apocalyptic number.
2053711013131 is a deficient number, since it is larger than the sum of its proper divisors (15314133).
2053711013131 is a wasteful number, since it uses less digits than its factorization.
2053711013131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15314132.
The product of its (nonzero) digits is 1890, while the sum is 28.
Adding to 2053711013131 its reverse (1313101173502), we get a palindrome (3366812186633).
The spelling of 2053711013131 in words is "two trillion, fifty-three billion, seven hundred eleven million, thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •