1013121011032 has 64 divisors (see below), whose sum is σ = 2064704916960. Its totient is φ = 463259596800.

The previous prime is 1013121011029. The next prime is 1013121011057. The reversal of 1013121011032 is 2301101213101.

It is a happy number.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29727282 + ... + 29761342.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1013121011032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1032352458480).

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

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

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

1013121011032 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 1013121011032 its reverse (2301101213101), we get a palindrome (3314222224133).

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