150633631414651 has 32 divisors (see below), whose sum is σ = 203030236869120. Its totient is φ = 108193744569600.

The previous prime is 150633631414639. The next prime is 150633631414667. The reversal of 150633631414651 is 156414136336051.

It is a cyclic number.

It is not a de Polignac number, because 150633631414651 - 2⁵ = 150633631414619 is a prime.

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

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

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, 1391326330 + ... + 1391434591.

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

Almost surely, 2^{150633631414651} is an apocalyptic number.

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

150633631414651 is a deficient number, since it is larger than the sum of its proper divisors (52396605454469).

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

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

The sum of its prime factors is 2782760995.

The product of its (nonzero) digits is 2332800, while the sum is 49.

The spelling of 150633631414651 in words is "one hundred fifty trillion, six hundred thirty-three billion, six hundred thirty-one million, four hundred fourteen thousand, six hundred fifty-one".