145367040000 has 1020 divisors, whose sum is σ = 599457937056. Its totient is φ = 30670848000.

The previous prime is 145367039981. The next prime is 145367040011. The reversal of 145367040000 is 40763541.

It is a super-2 number, since 2×145367040000² (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 145367040000.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 11182079994 + ... + 11182080006.

Almost surely, 2^145367040000 is an apocalyptic number.

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

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

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

145367040000 is an frugal number, since it uses more digits than its factorization.

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

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

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

The spelling of 145367040000 in words is "one hundred forty-five billion, three hundred sixty-seven million, forty thousand".