1115690491 has 2 divisors, whose sum is σ = 1115690492. Its totient is φ = 1115690490.

The previous prime is 1115690453. The next prime is 1115690503. The reversal of 1115690491 is 1940965111.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1115690491 - 2⁷ = 1115690363 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1115690491.

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

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

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

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

Almost surely, 2^1115690491 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 9720, while the sum is 37.

The square root of 1115690491 is about 33401.9534009614. The cubic root of 1115690491 is about 1037.1651380927.

The spelling of 1115690491 in words is "one billion, one hundred fifteen million, six hundred ninety thousand, four hundred ninety-one".