564211515214050 has 384 divisors, whose sum is σ = 1669862021990400. Its totient is φ = 124503429427200.

The previous prime is 564211515214049. The next prime is 564211515214091. The reversal of 564211515214050 is 50412515112465.

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

It is an unprimeable number.

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 171693301 + ... + 174948599.

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

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 240000, while the sum is 42.

The spelling of 564211515214050 in words is "five hundred sixty-four trillion, two hundred eleven billion, five hundred fifteen million, two hundred fourteen thousand, fifty".