Search a number
-
+
2557065569 is a prime number
BaseRepresentation
bin1001100001101001…
…1011100101100001
320121012120101112012
42120122123211201
520214102044234
61101422442305
7120236461442
oct23032334541
96535511465
102557065569
1110a2440233
125b4433395
133199bc866
141a38672c9
15ee74e0ce
hex9869b961

2557065569 has 2 divisors, whose sum is σ = 2557065570. Its totient is φ = 2557065568.

The previous prime is 2557065529. The next prime is 2557065571. The reversal of 2557065569 is 9655607552.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2493703969 + 63361600 = 49937^2 + 7960^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-2557065569 is a prime.

It is a super-2 number, since 2×25570655692 = 13077168648330587522, which contains 22 as substring.

Together with 2557065571, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 22557065569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2835000, while the sum is 50.

The square root of 2557065569 is about 50567.4358554989. The cubic root of 2557065569 is about 1367.4578693320.

The spelling of 2557065569 in words is "two billion, five hundred fifty-seven million, sixty-five thousand, five hundred sixty-nine".