Search a number
-
+
25505308055053 is a prime number
BaseRepresentation
bin1011100110010011010101…
…10100111001011000001101
310100022021122202211110222001
411303021222310321120031
511320334332330230203
6130124550551552301
75241461211256531
oct563115264713015
9110267582743861
1025505308055053
118143816525352
122a3b12408b691
1311301a9112938
1464266bb97bc1
152e36b91e291d
hex17326ad3960d

25505308055053 has 2 divisors, whose sum is σ = 25505308055054. Its totient is φ = 25505308055052.

The previous prime is 25505308055023. The next prime is 25505308055081. The reversal of 25505308055053 is 35055080350552.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 21041101095364 + 4464206959689 = 4587058^2 + 2112867^2 .

It is a cyclic number.

It is not a de Polignac number, because 25505308055053 - 25 = 25505308055021 is a prime.

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

It is a congruent number.

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

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

Almost surely, 225505308055053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2250000, while the sum is 46.

The spelling of 25505308055053 in words is "twenty-five trillion, five hundred five billion, three hundred eight million, fifty-five thousand, fifty-three".