Search a number
-
+
25050030569 is a prime number
BaseRepresentation
bin10111010101000110…
…010010000111101001
32101122210001101211222
4113111012102013221
5402300301434234
615301405031425
71544522514044
oct272506220751
971583041758
1025050030569
11a6950a8803
124a31255575
132492a027c5
1412d8c8bc5b
159b92a642e
hex5d51921e9

25050030569 has 2 divisors, whose sum is σ = 25050030570. Its totient is φ = 25050030568.

The previous prime is 25050030529. The next prime is 25050030601. The reversal of 25050030569 is 96503005052.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 24751155625 + 298874944 = 157325^2 + 17288^2 .

It is a cyclic number.

It is not a de Polignac number, because 25050030569 - 224 = 25033253353 is a prime.

It is a super-2 number, since 2×250500305692 (a number of 22 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 (25050030529) 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, 12525015284 + 12525015285.

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

Almost surely, 225050030569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 40500, while the sum is 35.

The spelling of 25050030569 in words is "twenty-five billion, fifty million, thirty thousand, five hundred sixty-nine".