106410641253100 has 144 divisors (see below), whose sum is σ = 244516140965376. Its totient is φ = 40111988224000.

The previous prime is 106410641253097. The next prime is 106410641253121. The reversal of 106410641253100 is 1352146014601.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 232800780 + ... + 233257420.

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 17280, while the sum is 34.

Adding to 106410641253100 its reverse (1352146014601), we get a palindrome (107762787267701).

The spelling of 106410641253100 in words is "one hundred six trillion, four hundred ten billion, six hundred forty-one million, two hundred fifty-three thousand, one hundred".