136066260000 has 480 divisors, whose sum is σ = 503759995200. Its totient is φ = 31843840000.

The previous prime is 136066259969. The next prime is 136066260007. The reversal of 136066260000 is 62660631.

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

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

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

It is a self number, because there is not a number n which added to its sum of digits gives 136066260000.

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

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

It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 19136446 + ... + 19143554.

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

Almost surely, 2^136066260000 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 136066260000 in words is "one hundred thirty-six billion, sixty-six million, two hundred sixty thousand".