Search a number
-
+
25688919674881 is a prime number
BaseRepresentation
bin1011101011101001010101…
…11011101001000000000001
310100221211120222111012020001
411311310222323221000001
511331341401414044011
6130345154330120001
75260651243265521
oct565645273510001
9110854528435201
1025688919674881
1182046784a1a01
122a6a827280001
1311445bb075228
1464b4c94c9681
152e8363a057c1
hex175d2aee9001

25688919674881 has 2 divisors, whose sum is σ = 25688919674882. Its totient is φ = 25688919674880.

The previous prime is 25688919674827. The next prime is 25688919674893. The reversal of 25688919674881 is 18847691988652.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 14833212634881 + 10855707040000 = 3851391^2 + 3294800^2 .

It is a cyclic number.

It is not a de Polignac number, because 25688919674881 - 27 = 25688919674753 is a prime.

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

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

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

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

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

Almost surely, 225688919674881 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 3344302080, while the sum is 82.

The spelling of 25688919674881 in words is "twenty-five trillion, six hundred eighty-eight billion, nine hundred nineteen million, six hundred seventy-four thousand, eight hundred eighty-one".