560111010100 has 72 divisors (see below), whose sum is σ = 1255980112128. Its totient is φ = 216587078400.

The previous prime is 560111010079. The next prime is 560111010163. The reversal of 560111010100 is 1010111065.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2840304 + ... + 3031096.

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

Almost surely, 2^560111010100 is an apocalyptic number.

560111010100 is a gapful number since it is divisible by the number (50) 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 560111010100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (627990056064).

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

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

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

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

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

The product of its (nonzero) digits is 30, while the sum is 16.

Adding to 560111010100 its reverse (1010111065), we get a palindrome (561121121165).

The spelling of 560111010100 in words is "five hundred sixty billion, one hundred eleven million, ten thousand, one hundred".