107516141 has 2 divisors, whose sum is σ = 107516142. Its totient is φ = 107516140.

The previous prime is 107516111. The next prime is 107516179. The reversal of 107516141 is 141615701.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 64561225 + 42954916 = 8035^2 + 6554^2 .

It is a cyclic number.

It is not a de Polignac number, because 107516141 - 2¹⁰ = 107515117 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

Almost surely, 2^107516141 is an apocalyptic number.

It is an amenable number.

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

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

107516141 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 107516141 is about 10368.9990355868. Note that the first 3 decimals coincide. The cubic root of 107516141 is about 475.5080672654.

The spelling of 107516141 in words is "one hundred seven million, five hundred sixteen thousand, one hundred forty-one".