36860141 has 2 divisors, whose sum is σ = 36860142. Its totient is φ = 36860140.

The previous prime is 36860137. The next prime is 36860143. The reversal of 36860141 is 14106863.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 24108100 + 12752041 = 4910^2 + 3571^2 .

It is a cyclic number.

It is not a de Polignac number, because 36860141 - 2² = 36860137 is a prime.

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 2^36860141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3456, while the sum is 29.

The square root of 36860141 is about 6071.2553067714. The cubic root of 36860141 is about 332.8017980836.

The spelling of 36860141 in words is "thirty-six million, eight hundred sixty thousand, one hundred forty-one".