Search a number
-
+
313670141 is a prime number
BaseRepresentation
bin10010101100100…
…011100111111101
3210212020002112122
4102230203213331
51120244421031
651043012325
710526103131
oct2254434775
9725202478
10313670141
11151071024
128906a0a5
134cca6045
142d9313c1
151c80e47b
hex12b239fd

313670141 has 2 divisors, whose sum is σ = 313670142. Its totient is φ = 313670140.

The previous prime is 313670101. The next prime is 313670153. The reversal of 313670141 is 141076313.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 201924100 + 111746041 = 14210^2 + 10571^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-313670141 is a prime.

It is a Chen prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2313670141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1512, while the sum is 26.

The square root of 313670141 is about 17710.7351908384. The cubic root of 313670141 is about 679.4503495171.

The spelling of 313670141 in words is "three hundred thirteen million, six hundred seventy thousand, one hundred forty-one".