1103723261 has 2 divisors, whose sum is σ = 1103723262. Its totient is φ = 1103723260.

The previous prime is 1103723233. The next prime is 1103723263. The reversal of 1103723261 is 1623273011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1090254361 + 13468900 = 33019^2 + 3670^2 .

It is an emirp because it is prime and its reverse (1623273011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1103723261 - 2³⁰ = 29981437 is a prime.

It is a Sophie Germain prime.

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

It is a Chen 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 1103723261.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1103723263) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551861630 + 551861631.

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

Almost surely, 2^1103723261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1512, while the sum is 26.

The square root of 1103723261 is about 33222.3307580910. The cubic root of 1103723261 is about 1033.4434851589.

Adding to 1103723261 its reverse (1623273011), we get a palindrome (2726996272).

The spelling of 1103723261 in words is "one billion, one hundred three million, seven hundred twenty-three thousand, two hundred sixty-one".