10105600000 has 144 divisors (see below), whose sum is σ = 25272210600. Its totient is φ = 4039680000.

The previous prime is 10105599991. The next prime is 10105600013. The reversal of 10105600000 is 650101.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6399211 + ... + 6400789.

Almost surely, 2^10105600000 is an apocalyptic number.

10105600000 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 10105600000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12636105300).

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

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

10105600000 is an frugal number, since it uses more digits than its factorization.

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

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

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

The spelling of 10105600000 in words is "ten billion, one hundred five million, six hundred thousand".