Search a number
-
+
25621516415153 is a prime number
BaseRepresentation
bin1011101001101011110010…
…11000100111000010110001
310100201101121112100211100002
411310311321120213002301
511324240331200241103
6130254210120235345
75253044030112311
oct564657130470261
9110641545324302
1025621516415153
11818902a07927a
122a5975600bb55
13113b1388cbba9
14648133707441
152e671b37e488
hex174d796270b1

25621516415153 has 2 divisors, whose sum is σ = 25621516415154. Its totient is φ = 25621516415152.

The previous prime is 25621516415149. The next prime is 25621516415329. The reversal of 25621516415153 is 35151461512652.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 17142191737969 + 8479324677184 = 4140313^2 + 2911928^2 .

It is a cyclic number.

It is not a de Polignac number, because 25621516415153 - 22 = 25621516415149 is a prime.

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

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

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

Almost surely, 225621516415153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1080000, while the sum is 47.

The spelling of 25621516415153 in words is "twenty-five trillion, six hundred twenty-one billion, five hundred sixteen million, four hundred fifteen thousand, one hundred fifty-three".