145695121080 has 128 divisors (see below), whose sum is σ = 463427308800. Its totient is φ = 36516759552.

The previous prime is 145695121057. The next prime is 145695121129. The reversal of 145695121080 is 80121596541.

145695121080 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a congruent number.

It is an unprimeable number.

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 31 ways as a sum of consecutive naturals, for example, 1459239 + ... + 1555881.

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

Almost surely, 2^145695121080 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 86400, while the sum is 42.

The spelling of 145695121080 in words is "one hundred forty-five billion, six hundred ninety-five million, one hundred twenty-one thousand, eighty".