Search a number
-
+
25015303331047 is a prime number
BaseRepresentation
bin1011011000000010101000…
…10001001101110011100111
310021120102212111111101201201
411230001110101031303213
511234322320123043142
6125111512142103331
75161203351655411
oct554012421156347
9107512774441651
1025015303331047
117a74a26645727
12298017257ab47
1310c5c189ba073
14626a662279b1
152d5a8ad37ab7
hex16c05444dce7

25015303331047 has 2 divisors, whose sum is σ = 25015303331048. Its totient is φ = 25015303331046.

The previous prime is 25015303331003. The next prime is 25015303331069. The reversal of 25015303331047 is 74013330351052.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 25015303331047 - 219 = 25015302806759 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 225015303331047 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 113400, while the sum is 37.

Adding to 25015303331047 its reverse (74013330351052), we get a palindrome (99028633682099).

The spelling of 25015303331047 in words is "twenty-five trillion, fifteen billion, three hundred three million, three hundred thirty-one thousand, forty-seven".