Search a number
-
+
25255891515149 is a prime number
BaseRepresentation
bin1011011111000010110000…
…11100010011011100001101
310022102102212111121110121222
411233201120130103130031
511302243031211441044
6125414221341533125
75214451351540601
oct557413034233415
9108372774543558
1025255891515149
118057a66382329
1229ba916b741a5
13111280abab109
1463456aa65501
152dbe6c72a8ee
hex16f85871370d

25255891515149 has 2 divisors, whose sum is σ = 25255891515150. Its totient is φ = 25255891515148.

The previous prime is 25255891515121. The next prime is 25255891515191. The reversal of 25255891515149 is 94151519855252.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 20302395849124 + 4953495666025 = 4505818^2 + 2225645^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 225255891515149 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 32400000, while the sum is 62.

The spelling of 25255891515149 in words is "twenty-five trillion, two hundred fifty-five billion, eight hundred ninety-one million, five hundred fifteen thousand, one hundred forty-nine".