131110301130000 has 200 divisors, whose sum is σ = 424358302500000. Its totient is φ = 34870493952000.

The previous prime is 131110301129989. The next prime is 131110301130089. The reversal of 131110301130000 is 31103011131.

It is a tau number, because it is divible by the number of its divisors (200).

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

It is a Harshad number since it is a multiple of its sum of digits (15).

It is an unprimeable number.

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

It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 5604376 + ... + 17135624.

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 27, while the sum is 15.

Adding to 131110301130000 its reverse (31103011131), we get a palindrome (131141404141131).

The spelling of 131110301130000 in words is "one hundred thirty-one trillion, one hundred ten billion, three hundred one million, one hundred thirty thousand".