[go: up one dir, main page]

Search a number
-
+
64657457 is a prime number
BaseRepresentation
bin1111011010100…
…1100000110001
311111122221100122
43312221200301
5113023014312
610225500025
71413402464
oct366514061
9144587318
1064657457
1133552117
12197a1615
131051ab67
1488312db
155a22b72
hex3da9831

64657457 has 2 divisors, whose sum is σ = 64657458. Its totient is φ = 64657456.

The previous prime is 64657447. The next prime is 64657459. The reversal of 64657457 is 75475646.

64657457 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 62236321 + 2421136 = 7889^2 + 1556^2 .

It is a cyclic number.

It is not a de Polignac number, because 64657457 - 24 = 64657441 is a prime.

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

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

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

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

Almost surely, 264657457 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 705600, while the sum is 44.

The square root of 64657457 is about 8040.9860713721. The cubic root of 64657457 is about 401.3650384594.

It can be divided in two parts, 6 and 4657457, that added together give a cube (4657463 = 1673).

The spelling of 64657457 in words is "sixty-four million, six hundred fifty-seven thousand, four hundred fifty-seven".