10563652515131 has 2 divisors, whose sum is σ = 10563652515132. Its totient is φ = 10563652515130.

The previous prime is 10563652515113. The next prime is 10563652515139. The reversal of 10563652515131 is 13151525636501.

Together with previous prime (10563652515113) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10563652515131 - 2⁴² = 6165606004027 is a prime.

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

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 405000, while the sum is 44.

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