Search a number
-
+
64315351 is a prime number
BaseRepresentation
bin1111010101010…
…1111111010111
311111000120002001
43311111333113
5112431042401
610214300131
71410446212
oct365257727
9144016061
1064315351
1133339091
1219657647
131042b229
148782779
1559a6601
hex3d55fd7

64315351 has 2 divisors, whose sum is σ = 64315352. Its totient is φ = 64315350.

The previous prime is 64315327. The next prime is 64315357. The reversal of 64315351 is 15351346.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 64315351 - 29 = 64314839 is a prime.

It is a Chen prime.

It is equal to p3802627 and since 64315351 and 3802627 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

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

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

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

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

Almost surely, 264315351 is an apocalyptic number.

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

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

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

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

The square root of 64315351 is about 8019.6852182614. The cubic root of 64315351 is about 400.6559051333.

Adding to 64315351 its reverse (15351346), we get a palindrome (79666697).

It can be divided in two parts, 643153 and 51, that added together give a square (643204 = 8022).

The spelling of 64315351 in words is "sixty-four million, three hundred fifteen thousand, three hundred fifty-one".