135015270 has 128 divisors (see below), whose sum is σ = 365105664. Its totient is φ = 31739904.

The previous prime is 135015269. The next prime is 135015277. The reversal of 135015270 is 72510531.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1391862 + ... + 1391958.

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

Almost surely, 2^135015270 is an apocalyptic number.

135015270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

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

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

The sum of its prime factors is 246.

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

The square root of 135015270 is about 11619.6071362159. The cubic root of 135015270 is about 513.0121250017.

The spelling of 135015270 in words is "one hundred thirty-five million, fifteen thousand, two hundred seventy".