Search a number
-
+
25389101652157 is a prime number
BaseRepresentation
bin1011100010111010111000…
…11000101001100010111101
310022220011201010222120101001
411301131130120221202331
511311433340010332112
6125555331533250301
75230205415165145
oct561353430514275
9108804633876331
1025389101652157
1180a9503a98951
122a206b2933991
131122249b604a9
1463aba65d7925
152e06672e0c57
hex17175c6298bd

25389101652157 has 2 divisors, whose sum is σ = 25389101652158. Its totient is φ = 25389101652156.

The previous prime is 25389101652113. The next prime is 25389101652197. The reversal of 25389101652157 is 75125610198352.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 15651668775961 + 9737432876196 = 3956219^2 + 3120486^2 .

It is a cyclic number.

It is not a de Polignac number, because 25389101652157 - 223 = 25389093263549 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 225389101652157 is an apocalyptic number.

It is an amenable number.

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

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

25389101652157 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 4536000, while the sum is 55.

The spelling of 25389101652157 in words is "twenty-five trillion, three hundred eighty-nine billion, one hundred one million, six hundred fifty-two thousand, one hundred fifty-seven".