Base | Representation |
---|---|
bin | 100101010100111111011… |
… | …101010110001000011101 |
3 | 100002020010102100021220101 |
4 | 211110333131112020131 |
5 | 314011421443230044 |
6 | 5242230204021101 |
7 | 353220026242165 |
oct | 45247735261035 |
9 | 10066112307811 |
10 | 2565160133149 |
11 | 8a9973026799 |
12 | 35518ab31791 |
13 | 157b80207143 |
14 | 8c2239cd5a5 |
15 | 46ad439bcd4 |
hex | 2553f75621d |
2565160133149 has 2 divisors, whose sum is σ = 2565160133150. Its totient is φ = 2565160133148.
The previous prime is 2565160133117. The next prime is 2565160133161. The reversal of 2565160133149 is 9413310615652.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2282607288900 + 282552844249 = 1510830^2 + 531557^2 .
It is a cyclic number.
It is not a de Polignac number, because 2565160133149 - 25 = 2565160133117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2565160133099 and 2565160133108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2565160133749) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1282580066574 + 1282580066575.
It is an arithmetic number, because the mean of its divisors is an integer number (1282580066575).
Almost surely, 22565160133149 is an apocalyptic number.
It is an amenable number.
2565160133149 is a deficient number, since it is larger than the sum of its proper divisors (1).
2565160133149 is an equidigital number, since it uses as much as digits as its factorization.
2565160133149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 583200, while the sum is 46.
The spelling of 2565160133149 in words is "two trillion, five hundred sixty-five billion, one hundred sixty million, one hundred thirty-three thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •