150482716906368 has 6144 divisors, whose sum is σ = 630122250240000. Its totient is φ = 31473598464000.

The previous prime is 150482716906309. The next prime is 150482716906397. The reversal of 150482716906368 is 863609617284051.

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

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 767 ways as a sum of consecutive naturals, for example, 3670310168428 + ... + 3670310168468.

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

It is a 2-persistent number, because it is pandigital, and so is 2⋅150482716906368 = 300965433812736, but 3⋅150482716906368 = 451448150719104 is not.

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

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

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

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

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

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

The product of its (nonzero) digits is 104509440, while the sum is 66.

The spelling of 150482716906368 in words is "one hundred fifty trillion, four hundred eighty-two billion, seven hundred sixteen million, nine hundred six thousand, three hundred sixty-eight".