Search a number
-
+
25614361 is a prime number
BaseRepresentation
bin110000110110…
…1100000011001
31210012100022001
41201231200121
523024124421
62313001001
7430501303
oct141554031
953170261
1025614361
11135054a3
1286b3161
1353caa36
14358a973
1523ae691
hex186d819

25614361 has 2 divisors, whose sum is σ = 25614362. Its totient is φ = 25614360.

The previous prime is 25614331. The next prime is 25614367. The reversal of 25614361 is 16341652.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 24314761 + 1299600 = 4931^2 + 1140^2 .

It is a cyclic number.

It is not a de Polignac number, because 25614361 - 27 = 25614233 is a prime.

It is an alternating number because its digits alternate between even and odd.

It is equal to p1601884 and since 25614361 and 1601884 have the same sum of digits, it is a Honaker prime.

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

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

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

Almost surely, 225614361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 4320, while the sum is 28.

The square root of 25614361 is about 5061.0632282160. The cubic root of 25614361 is about 294.7776203979. Note that the first 3 decimals are identical.

It can be divided in two parts, 25 and 614361, that added together give a triangular number (614386 = T1108).

The spelling of 25614361 in words is "twenty-five million, six hundred fourteen thousand, three hundred sixty-one".