151311104013 has 4 divisors (see below), whose sum is σ = 201748138688. Its totient is φ = 100874069340.

The previous prime is 151311104011. The next prime is 151311104017. The reversal of 151311104013 is 310401113151.

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: 310401113151 = 3 ⋅103467037717.

It is not a de Polignac number, because 151311104013 - 2¹ = 151311104011 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 2^151311104013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 50437034674.

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

Adding to 151311104013 its reverse (310401113151), we get a palindrome (461712217164).

The spelling of 151311104013 in words is "one hundred fifty-one billion, three hundred eleven million, one hundred four thousand, thirteen".