Search a number
-
+
254401240142561 is a prime number
BaseRepresentation
bin111001110110000001100111…
…100011001001001011100001
31020100202112001211121011102012
4321312001213203021023201
5231321102214434030221
62301022152153402305
7104404611614012051
oct7166014743111341
91210675054534365
10254401240142561
1174072a61919906
12246487b8709395
13abc4c1b026785
1446b712b30d561
151e628603bc65b
hexe760678c92e1

254401240142561 has 2 divisors, whose sum is σ = 254401240142562. Its totient is φ = 254401240142560.

The previous prime is 254401240142509. The next prime is 254401240142563. The reversal of 254401240142561 is 165241042104452.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 194885955544336 + 59515284598225 = 13960156^2 + 7714615^2 .

It is a cyclic number.

It is not a de Polignac number, because 254401240142561 - 226 = 254401173033697 is a prime.

Together with 254401240142563, it forms a pair of twin primes.

It is a Chen prime.

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

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

Almost surely, 2254401240142561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 307200, while the sum is 41.

The spelling of 254401240142561 in words is "two hundred fifty-four trillion, four hundred one billion, two hundred forty million, one hundred forty-two thousand, five hundred sixty-one".