1103151 has 16 divisors (see below), whose sum is σ = 1698048. Its totient is φ = 624000.

The previous prime is 1103143. The next prime is 1103171. The reversal of 1103151 is 1513011.

It is not a de Polignac number, because 1103151 - 2³ = 1103143 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2551 + ... + 2951.

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

2^1103151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 542.

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

The square root of 1103151 is about 1050.3099542516. The cubic root of 1103151 is about 103.3264846889.

Adding to 1103151 its reverse (1513011), we get a palindrome (2616162).

The spelling of 1103151 in words is "one million, one hundred three thousand, one hundred fifty-one".