Search a number
-
+
313664081 is a prime number
BaseRepresentation
bin10010101100100…
…010001001010001
3210212012210020012
4102230202021101
51120244222311
651042524305
710526046353
oct2254421121
9725183205
10313664081
11151067515
1289066695
134cca3363
142d92d0d3
151c80c78b
hex12b22251

313664081 has 2 divisors, whose sum is σ = 313664082. Its totient is φ = 313664080.

The previous prime is 313664077. The next prime is 313664083. The reversal of 313664081 is 180466313.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 307827025 + 5837056 = 17545^2 + 2416^2 .

It is a cyclic number.

It is not a de Polignac number, because 313664081 - 22 = 313664077 is a prime.

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

Together with 313664083, it forms a pair of twin primes.

It is a Chen prime.

It is equal to p16951811 and since 313664081 and 16951811 have the same sum of digits, it is a Honaker prime.

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

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

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

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

Almost surely, 2313664081 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10368, while the sum is 32.

The square root of 313664081 is about 17710.5641073344. The cubic root of 313664081 is about 679.4459739060.

The spelling of 313664081 in words is "three hundred thirteen million, six hundred sixty-four thousand, eighty-one".