Search a number
-
+
25057500737 is a prime number
BaseRepresentation
bin10111010101100010…
…110001111001000001
32101200022002220222212
4113111202301321001
5402304210010422
615302233111505
71544643146003
oct272542617101
971608086885
1025057500737
11a6993401a5
124a33858595
132494419a19
1412d9c74373
159b9c7e9e2
hex5d58b1e41

25057500737 has 2 divisors, whose sum is σ = 25057500738. Its totient is φ = 25057500736.

The previous prime is 25057500709. The next prime is 25057500739. The reversal of 25057500737 is 73700575052.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 12724065601 + 12333435136 = 112801^2 + 111056^2 .

It is a cyclic number.

It is not a de Polignac number, because 25057500737 - 230 = 23983758913 is a prime.

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

It is a Chen prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 225057500737 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 257250, while the sum is 41.

The spelling of 25057500737 in words is "twenty-five billion, fifty-seven million, five hundred thousand, seven hundred thirty-seven".