Search a number
-
+
2565137669761 is a prime number
BaseRepresentation
bin100101010100111110000…
…111101001111010000001
3100002020001212002000221001
4211110332013221322001
5314011400220413021
65242224042332001
7353216334303232
oct45247607517201
910066055060831
102565137669761
118a9961383707
123551834ba001
13157b786706b4
148c220a23089
1546ad2411091
hex2553e1e9e81

2565137669761 has 2 divisors, whose sum is σ = 2565137669762. Its totient is φ = 2565137669760.

The previous prime is 2565137669747. The next prime is 2565137669777. The reversal of 2565137669761 is 1679667315652.

2565137669761 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2408998889025 + 156138780736 = 1552095^2 + 395144^2 .

It is a cyclic number.

It is not a de Polignac number, because 2565137669761 - 25 = 2565137669729 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 2565137669693 and 2565137669702.

It is not a weakly prime, because it can be changed into another prime (2565137669701) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1282568834880 + 1282568834881.

It is an arithmetic number, because the mean of its divisors is an integer number (1282568834881).

Almost surely, 22565137669761 is an apocalyptic number.

It is an amenable number.

2565137669761 is a deficient number, since it is larger than the sum of its proper divisors (1).

2565137669761 is an equidigital number, since it uses as much as digits as its factorization.

2565137669761 is an odious number, because the sum of its binary digits is odd.

The product of its digits is 85730400, while the sum is 64.

The spelling of 2565137669761 in words is "two trillion, five hundred sixty-five billion, one hundred thirty-seven million, six hundred sixty-nine thousand, seven hundred sixty-one".