10645653335200 has 144 divisors (see below), whose sum is σ = 27993887089056. Its totient is φ = 3929852390400.

The previous prime is 10645653335179. The next prime is 10645653335209. The reversal of 10645653335200 is 253335654601.

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

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

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

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

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 10645653335200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13996943544528).

10645653335200 is an abundant number, since it is smaller than the sum of its proper divisors (17348233753856).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 972000, while the sum is 43.

Adding to 10645653335200 its reverse (253335654601), we get a palindrome (10898988989801).

The spelling of 10645653335200 in words is "ten trillion, six hundred forty-five billion, six hundred fifty-three million, three hundred thirty-five thousand, two hundred".