1151521069 has 2 divisors, whose sum is σ = 1151521070. Its totient is φ = 1151521068.

The previous prime is 1151520991. The next prime is 1151521073. The reversal of 1151521069 is 9601251511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 994645444 + 156875625 = 31538^2 + 12525^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1151521069 - 2¹⁵ = 1151488301 is a prime.

It is a super-2 number, since 2×1151521069² = 2652001544701805522, which contains 22 as substring.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1151521369) 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, 575760534 + 575760535.

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

Almost surely, 2^1151521069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2700, while the sum is 31.

The square root of 1151521069 is about 33934.0694435548. The cubic root of 1151521069 is about 1048.1512650591.

The spelling of 1151521069 in words is "one billion, one hundred fifty-one million, five hundred twenty-one thousand, sixty-nine".