Search a number
-
+
201425837 is a prime number
BaseRepresentation
bin11000000000110…
…00001110101101
3112001000111022012
430000120032231
5403031111322
631553131005
74664043224
oct1400301655
9461014265
10201425837
11a3777238
1257559a65
13329662b2
141ca73cbb
1512a3bae2
hexc0183ad

201425837 has 2 divisors, whose sum is σ = 201425838. Its totient is φ = 201425836.

The previous prime is 201425831. The next prime is 201425839. The reversal of 201425837 is 738524102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 143376676 + 58049161 = 11974^2 + 7619^2 .

It is a cyclic number.

It is not a de Polignac number, because 201425837 - 26 = 201425773 is a prime.

It is a super-2 number, since 2×2014258372 = 81144735622301138, which contains 22 as substring.

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 2201425837 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13440, while the sum is 32.

The square root of 201425837 is about 14192.4570459100. The cubic root of 201425837 is about 586.1899823538.

Adding to 201425837 its reverse (738524102), we get a palindrome (939949939).

The spelling of 201425837 in words is "two hundred one million, four hundred twenty-five thousand, eight hundred thirty-seven".