155015141 has 4 divisors (see below), whose sum is σ = 155052300. Its totient is φ = 154977984.

The previous prime is 155015131. The next prime is 155015173. The reversal of 155015141 is 141510551.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 8726116 + 146289025 = 2954^2 + 12095^2 .

It is a cyclic number.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (155015111) 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 in 3 ways as a sum of consecutive naturals, for example, 11396 + ... + 20973.

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

Almost surely, 2^155015141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 37158.

The product of its (nonzero) digits is 500, while the sum is 23.

The square root of 155015141 is about 12450.5076603326. The cubic root of 155015141 is about 537.1860258256.

Adding to 155015141 its reverse (141510551), we get a palindrome (296525692).

The spelling of 155015141 in words is "one hundred fifty-five million, fifteen thousand, one hundred forty-one".