Search a number
-
+
25343411131361 is a prime number
BaseRepresentation
bin1011100001100101110010…
…00001001001001111100001
310022201210202220012121212002
411300302321001021033201
511310211301222200421
6125522334035013345
75224000232155541
oct560627101111741
9108653686177762
1025343411131361
118091097978364
122a1388113a255
13111ab47b7b77b
146388b037b321
152de390e53b0b
hex170cb90493e1

25343411131361 has 2 divisors, whose sum is σ = 25343411131362. Its totient is φ = 25343411131360.

The previous prime is 25343411131301. The next prime is 25343411131399. The reversal of 25343411131361 is 16313111434352.

It is an a-pointer prime, because the next prime (25343411131399) can be obtained adding 25343411131361 to its sum of digits (38).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 25296061371361 + 47349760000 = 5029519^2 + 217600^2 .

It is a cyclic number.

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

It is a super-3 number, since 3×253434111313613 (a number of 41 digits) contains 333 as substring.

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

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

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

Almost surely, 225343411131361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 77760, while the sum is 38.

The spelling of 25343411131361 in words is "twenty-five trillion, three hundred forty-three billion, four hundred eleven million, one hundred thirty-one thousand, three hundred sixty-one".