Search a number
-
+
25640987980613 is a prime number
BaseRepresentation
bin1011101010010000000011…
…11110101111001101000101
310100210020212112112211200012
411311020001332233031011
511330100220410334423
6130311150211400005
75254333404513605
oct565100176571505
9110706775484605
1025640987980613
11819631128a635
122a6148abb3005
13113cc1c977165
1464905d754c05
152e6eaaa17078
hex175201faf345

25640987980613 has 2 divisors, whose sum is σ = 25640987980614. Its totient is φ = 25640987980612.

The previous prime is 25640987980607. The next prime is 25640987980637. The reversal of 25640987980613 is 31608978904652.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 18557123608804 + 7083864371809 = 4307798^2 + 2661553^2 .

It is a cyclic number.

It is not a de Polignac number, because 25640987980613 - 216 = 25640987915077 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (25640987988613) 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, 12820493990306 + 12820493990307.

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

It is a 1-persistent number, because it is pandigital, but 2⋅25640987980613 = 51281975961226 is not.

Almost surely, 225640987980613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 156764160, while the sum is 68.

The spelling of 25640987980613 in words is "twenty-five trillion, six hundred forty billion, nine hundred eighty-seven million, nine hundred eighty thousand, six hundred thirteen".