13101323113032 has 256 divisors, whose sum is σ = 40975770931200. Its totient is φ = 3391247278080.

The previous prime is 13101323113027. The next prime is 13101323113033. The reversal of 13101323113032 is 23031132310131.

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

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

It is not an unprimeable number, because it can be changed into a prime (13101323113033) by changing a digit.

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 63 ways as a sum of consecutive naturals, for example, 1178913108 + ... + 1178924220.

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 972, while the sum is 24.

Adding to 13101323113032 its reverse (23031132310131), we get a palindrome (36132455423163).

The spelling of 13101323113032 in words is "thirteen trillion, one hundred one billion, three hundred twenty-three million, one hundred thirteen thousand, thirty-two".