151014013041513 has 16 divisors (see below), whose sum is σ = 201707314548480. Its totient is φ = 100498362620544.

The previous prime is 151014013041439. The next prime is 151014013041533. The reversal of 151014013041513 is 315140310410151.

It is not a de Polignac number, because 151014013041513 - 2¹² = 151014013037417 is a prime.

It is a super-2 number, since 2×151014013041513² (a number of 29 digits) contains 22 as substring.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 367777920 + ... + 368188302.

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 626528.

The product of its (nonzero) digits is 3600, while the sum is 30.

Adding to 151014013041513 its reverse (315140310410151), we get a palindrome (466154323451664).

The spelling of 151014013041513 in words is "one hundred fifty-one trillion, fourteen billion, thirteen million, forty-one thousand, five hundred thirteen".