10561646665063 has 64 divisors (see below), whose sum is σ = 12467093087232. Its totient is φ = 8858566379520.

The previous prime is 10561646665049. The next prime is 10561646665099. The reversal of 10561646665063 is 36056664616501.

It is a happy number.

It is not a de Polignac number, because 10561646665063 - 2⁹ = 10561646664551 is a prime.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10561646665663) 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 in 63 ways as a sum of consecutive naturals, for example, 771423048 + ... + 771436738.

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

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

10561646665063 is a gapful number since it is divisible by the number (13) formed by its first and last digit.

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

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

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

The sum of its prime factors is 14824.

The product of its (nonzero) digits is 13996800, while the sum is 55.

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