150311361 has 4 divisors (see below), whose sum is σ = 200415152. Its totient is φ = 100207572.

The previous prime is 150311323. The next prime is 150311377. The reversal of 150311361 is 163113051.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 163113051 = 3 ⋅54371017.

It is not a de Polignac number, because 150311361 - 2¹³ = 150303169 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25051891 + ... + 25051896.

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

Almost surely, 2^150311361 is an apocalyptic number.

It is an amenable number.

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

150311361 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 50103790.

The product of its (nonzero) digits is 270, while the sum is 21.

The square root of 150311361 is about 12260.1533840324. The cubic root of 150311361 is about 531.6966643299.

The spelling of 150311361 in words is "one hundred fifty million, three hundred eleven thousand, three hundred sixty-one".