145342216015656 has 256 divisors, whose sum is σ = 434248499174400. Its totient is φ = 40016378572800.

The previous prime is 145342216015589. The next prime is 145342216015657. The reversal of 145342216015656 is 656510612243541.

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

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

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

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

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

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

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

Almost surely, 2^{145342216015656} 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 145342216015656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (217124249587200).

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

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

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

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

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

The product of its (nonzero) digits is 5184000, while the sum is 51.

The spelling of 145342216015656 in words is "one hundred forty-five trillion, three hundred forty-two billion, two hundred sixteen million, fifteen thousand, six hundred fifty-six".