1159664901551 has 8 divisors (see below), whose sum is σ = 1255846823280. Its totient is φ = 1064479684032.

The previous prime is 1159664901539. The next prime is 1159664901559. The reversal of 1159664901551 is 1551094669511.

It is a happy number.

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 1159664901551 - 2³⁸ = 884786994607 is a prime.

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1159664901559) by changing a digit.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 249173630 + ... + 249178283.

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

Almost surely, 2^{1159664901551} is an apocalyptic number.

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

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

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

The sum of its prime factors is 498352105.

The product of its (nonzero) digits is 1458000, while the sum is 53.

The spelling of 1159664901551 in words is "one trillion, one hundred fifty-nine billion, six hundred sixty-four million, nine hundred one thousand, five hundred fifty-one".