145101111 has 8 divisors (see below), whose sum is σ = 199709184. Its totient is φ = 93613560.

The previous prime is 145101097. The next prime is 145101199. The reversal of 145101111 is 111101541.

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (145101211) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 780021 + ... + 780206.

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

Almost surely, 2^145101111 is an apocalyptic number.

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

145101111 is a wasteful number, since it uses less digits than its factorization.

145101111 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 1560261.

The product of its (nonzero) digits is 20, while the sum is 15.

The square root of 145101111 is about 12045.7922528989. The cubic root of 145101111 is about 525.4808727897.

Adding to 145101111 its reverse (111101541), we get a palindrome (256202652).

The spelling of 145101111 in words is "one hundred forty-five million, one hundred one thousand, one hundred eleven".