Search a number
-
+
25114374095861 is a prime number
BaseRepresentation
bin1011011010111011001010…
…10110001100001111110101
310021220220120220121200221102
411231131211112030033311
511242433214232031421
6125225214552255445
75201311413403421
oct555354526141765
9107826526550842
1025114374095861
118002a454a0666
1229974010a1585
131102376b382ab
1462b783abbb81
152d84386bd60b
hex16d76558c3f5

25114374095861 has 2 divisors, whose sum is σ = 25114374095862. Its totient is φ = 25114374095860.

The previous prime is 25114374095843. The next prime is 25114374095887. The reversal of 25114374095861 is 16859047341152.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 17490010595236 + 7624363500625 = 4182106^2 + 2761225^2 .

It is a cyclic number.

It is not a de Polignac number, because 25114374095861 - 210 = 25114374094837 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 225114374095861 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7257600, while the sum is 56.

The spelling of 25114374095861 in words is "twenty-five trillion, one hundred fourteen billion, three hundred seventy-four million, ninety-five thousand, eight hundred sixty-one".