Search a number
-
+
401425501 is a prime number
BaseRepresentation
bin10111111011010…
…100010001011101
31000222100112021011
4113323110101131
51310231104001
6103455535221
712643026511
oct2773242135
91028315234
10401425501
11196659a14
12b252a511
13652203a9
143b456141
1525395d51
hex17ed445d

401425501 has 2 divisors, whose sum is σ = 401425502. Its totient is φ = 401425500.

The previous prime is 401425499. The next prime is 401425513. The reversal of 401425501 is 105524104.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 373494276 + 27931225 = 19326^2 + 5285^2 .

It is a cyclic number.

It is not a de Polignac number, because 401425501 - 21 = 401425499 is a prime.

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

Together with 401425499, 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 (401425561) by changing a digit.

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

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

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

Almost surely, 2401425501 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 800, while the sum is 22.

The square root of 401425501 is about 20035.6058306206. The cubic root of 401425501 is about 737.6805271366.

Adding to 401425501 its reverse (105524104), we get a palindrome (506949605).

The spelling of 401425501 in words is "four hundred one million, four hundred twenty-five thousand, five hundred one".