151064371 has 2 divisors, whose sum is σ = 151064372. Its totient is φ = 151064370.

The previous prime is 151064369. The next prime is 151064411. The reversal of 151064371 is 173460151.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 151064371 - 2¹ = 151064369 is a prime.

Together with 151064369, it forms a pair of twin primes.

It is a Chen prime.

It is not a weakly prime, because it can be changed into another prime (151064321) by changing a digit.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75532185 + 75532186.

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

Almost surely, 2^151064371 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2520, while the sum is 28.

The square root of 151064371 is about 12290.8246672060. The cubic root of 151064371 is about 532.5830603607.

The spelling of 151064371 in words is "one hundred fifty-one million, sixty-four thousand, three hundred seventy-one".