691511041 has 8 divisors (see below), whose sum is σ = 746705960. Its totient is φ = 636602112.

The previous prime is 691511021. The next prime is 691511081. The reversal of 691511041 is 140115196.

691511041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 4 ways, for example, as 124880625 + 566630416 = 11175^2 + 23804^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 691511041 - 2⁷ = 691510913 is a prime.

It is not an unprimeable number, because it can be changed into a prime (691511011) 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, 66456 + ... + 76153.

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

Almost surely, 2^691511041 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 142995.

The product of its (nonzero) digits is 1080, while the sum is 28.

The square root of 691511041 is about 26296.5975175497. The cubic root of 691511041 is about 884.3001653451.

It can be divided in two parts, 6915 and 11041, that added together give a square (17956 = 134²).

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