[go: up one dir, main page]

Search a number
-
+
65626313 is a prime number
BaseRepresentation
bin1111101001011…
…0000011001001
311120111011101012
43322112003021
5113300020223
610302333305
71424546234
oct372260311
9146434335
1065626313
1134054025
1219b8a235
1310799b4c
148a0441b
155b64c78
hex3e960c9

65626313 has 2 divisors, whose sum is σ = 65626314. Its totient is φ = 65626312.

The previous prime is 65626279. The next prime is 65626321. The reversal of 65626313 is 31362656.

65626313 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., 57577744 + 8048569 = 7588^2 + 2837^2 .

It is a cyclic number.

It is not a de Polignac number, because 65626313 - 212 = 65622217 is a prime.

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

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

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

Almost surely, 265626313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 19440, while the sum is 32.

The square root of 65626313 is about 8101.0069127239. The cubic root of 65626313 is about 403.3598515603.

Adding to 65626313 its reverse (31362656), we get a palindrome (96988969).

The spelling of 65626313 in words is "sixty-five million, six hundred twenty-six thousand, three hundred thirteen".