103695041 has 2 divisors, whose sum is σ = 103695042. Its totient is φ = 103695040.

The previous prime is 103695013. The next prime is 103695043. The reversal of 103695041 is 140596301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 92236816 + 11458225 = 9604^2 + 3385^2 .

It is a cyclic number.

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

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

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 103694995 and 103695013.

It is not a weakly prime, because it can be changed into another prime (103695043) 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 as a sum of consecutive naturals, namely, 51847520 + 51847521.

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

Almost surely, 2^103695041 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 103695041 is about 10183.0762051553. The cubic root of 103695041 is about 469.8068332508.

The spelling of 103695041 in words is "one hundred three million, six hundred ninety-five thousand, forty-one".