1152610551563 has 4 divisors (see below), whose sum is σ = 1152662900760. Its totient is φ = 1152558202368.

The previous prime is 1152610551553. The next prime is 1152610551569. The reversal of 1152610551563 is 3651550162511.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

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

It is a super-2 number, since 2×1152610551563² (a number of 25 digits) contains 22 as substring.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (1152610551569) 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 3 ways as a sum of consecutive naturals, for example, 26141558 + ... + 26185611.

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

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

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

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

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

The sum of its prime factors is 52349196.

The product of its (nonzero) digits is 135000, while the sum is 41.

The spelling of 1152610551563 in words is "one trillion, one hundred fifty-two billion, six hundred ten million, five hundred fifty-one thousand, five hundred sixty-three".