Base | Representation |
---|---|
bin | 11101111000011111011… |
… | …001011101101010001001 |
3 | 21021022111102022021111012 |
4 | 131320133121131222021 |
5 | 232121102402330030 |
6 | 4211212524413305 |
7 | 301235111441144 |
oct | 35703731355211 |
9 | 7238442267435 |
10 | 2053521136265 |
11 | 721991167705 |
12 | 291ba00a7235 |
13 | 11b852961081 |
14 | 71568ac105b |
15 | 3863ba57095 |
hex | 1de1f65da89 |
2053521136265 has 4 divisors (see below), whose sum is σ = 2464225363524. Its totient is φ = 1642816909008.
The previous prime is 2053521136237. The next prime is 2053521136267. The reversal of 2053521136265 is 5626311253502.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 827177517049 + 1226343619216 = 909493^2 + 1107404^2 .
It is a cyclic number.
It is not a de Polignac number, because 2053521136265 - 216 = 2053521070729 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2053521136267) 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, 205352113622 + ... + 205352113631.
It is an arithmetic number, because the mean of its divisors is an integer number (616056340881).
Almost surely, 22053521136265 is an apocalyptic number.
It is an amenable number.
2053521136265 is a deficient number, since it is larger than the sum of its proper divisors (410704227259).
2053521136265 is an equidigital number, since it uses as much as digits as its factorization.
2053521136265 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 410704227258.
The product of its (nonzero) digits is 324000, while the sum is 41.
Adding to 2053521136265 its reverse (5626311253502), we get a palindrome (7679832389767).
The spelling of 2053521136265 in words is "two trillion, fifty-three billion, five hundred twenty-one million, one hundred thirty-six thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •