Search a number
-
+
706310981 is a prime number
BaseRepresentation
bin101010000110010…
…111001101000101
31211020001022111222
4222012113031011
52421303422411
6154030410125
723334354455
oct5206271505
91736038458
10706310981
1133276a992
12178660945
13b343babc
1469b3bd65
154201c4db
hex2a197345

706310981 has 2 divisors, whose sum is σ = 706310982. Its totient is φ = 706310980.

The previous prime is 706310963. The next prime is 706310999. The reversal of 706310981 is 189013607.

It is a balanced prime because it is at equal distance from previous prime (706310963) and next prime (706310999).

It can be written as a sum of positive squares in only one way, i.e., 508908481 + 197402500 = 22559^2 + 14050^2 .

It is an emirp because it is prime and its reverse (189013607) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 706310981 - 226 = 639202117 is a prime.

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

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 2706310981 is an apocalyptic number.

It is an amenable number.

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

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

706310981 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 9072, while the sum is 35.

The square root of 706310981 is about 26576.5118290569. The cubic root of 706310981 is about 890.5643775476.

The spelling of 706310981 in words is "seven hundred six million, three hundred ten thousand, nine hundred eighty-one".