Search a number
-
+
425676689 is a prime number
BaseRepresentation
bin11001010111110…
…100111110010001
31002122222121122022
4121113310332101
51332433123224
6110123421225
713356122624
oct3127647621
91078877568
10425676689
111a9313219
12ba684815
136a2617c9
1440769dbb
152758665e
hex195f4f91

425676689 has 2 divisors, whose sum is σ = 425676690. Its totient is φ = 425676688.

The previous prime is 425676677. The next prime is 425676743. The reversal of 425676689 is 986676524.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 422097025 + 3579664 = 20545^2 + 1892^2 .

It is a cyclic number.

It is not a de Polignac number, because 425676689 - 228 = 157241233 is a prime.

It is a super-3 number, since 3×4256766893 (a number of 27 digits) contains 333 as substring.

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 425676689.

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

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

Almost surely, 2425676689 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 4354560, while the sum is 53.

The square root of 425676689 is about 20631.9337193584. The cubic root of 425676689 is about 752.2461192898.

The spelling of 425676689 in words is "four hundred twenty-five million, six hundred seventy-six thousand, six hundred eighty-nine".