151106713 has 4 divisors (see below), whose sum is σ = 151139968. Its totient is φ = 151073460.

The previous prime is 151106701. The next prime is 151106717. The reversal of 151106713 is 317601151.

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: 317601151 = 7 ⋅45371593.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-151106713 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (151106717) 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 in 3 ways as a sum of consecutive naturals, for example, 8481 + ... + 19342.

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

Almost surely, 2^151106713 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 33254.

The product of its (nonzero) digits is 630, while the sum is 25.

The square root of 151106713 is about 12292.5470509573. The cubic root of 151106713 is about 532.6328151445.

Adding to 151106713 its reverse (317601151), we get a palindrome (468707864).

The spelling of 151106713 in words is "one hundred fifty-one million, one hundred six thousand, seven hundred thirteen".