10566753215251 has 12 divisors (see below), whose sum is σ = 11056846072888. Its totient is φ = 10097544197664.

The previous prime is 10566753215201. The next prime is 10566753215261. The reversal of 10566753215251 is 15251235766501.

It is not a de Polignac number, because 10566753215251 - 2⁹ = 10566753214739 is a prime.

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

It is a hoax number, since the sum of its digits (49) coincides with the sum of the digits of its distinct prime factors.

It is a Duffinian number.

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

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

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

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

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

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

The sum of its prime factors is 19337922 (or 19337899 counting only the distinct ones).

The product of its (nonzero) digits is 1890000, while the sum is 49.

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