Search a number
-
+
2525430680609 is a prime number
BaseRepresentation
bin100100101111111111011…
…001100000110000100001
322221102120121100222202012
4210233333121200300201
5312334040223234414
65212100012002305
7350312345412404
oct44577731406041
98842517328665
102525430680609
11894035865aa1
12349541760395
131541bb20c945
148a335329d3b
1545a5b50733e
hex24bff660c21

2525430680609 has 2 divisors, whose sum is σ = 2525430680610. Its totient is φ = 2525430680608.

The previous prime is 2525430680587. The next prime is 2525430680627. The reversal of 2525430680609 is 9060860345252.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2524841550625 + 589129984 = 1588975^2 + 24272^2 .

It is a cyclic number.

It is not a de Polignac number, because 2525430680609 - 216 = 2525430615073 is a prime.

It is a super-2 number, since 2×25254306806092 (a number of 26 digits) contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 22525430680609 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 2525430680609 in words is "two trillion, five hundred twenty-five billion, four hundred thirty million, six hundred eighty thousand, six hundred nine".