670115141 has 2 divisors, whose sum is σ = 670115142. Its totient is φ = 670115140.

The previous prime is 670115113. The next prime is 670115203. The reversal of 670115141 is 141511076.

It is a happy number.

670115141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 365612641 + 304502500 = 19121^2 + 17450^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 2^670115141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 670115141 is about 25886.5822579961. The cubic root of 670115141 is about 875.0841349302.

The spelling of 670115141 in words is "six hundred seventy million, one hundred fifteen thousand, one hundred forty-one".