151101010613 has 8 divisors (see below), whose sum is σ = 176702843328. Its totient is φ = 126503171424.

The previous prime is 151101010579. The next prime is 151101010673. The reversal of 151101010613 is 316010101151.

151101010613 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 151101010613 - 2¹⁴ = 151100994229 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 (151101010673) by changing a digit.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 250998056 + ... + 250998657.

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

Almost surely, 2^151101010613 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 501996763.

The product of its (nonzero) digits is 90, while the sum is 20.

Adding to 151101010613 its reverse (316010101151), we get a palindrome (467111111764).

The spelling of 151101010613 in words is "one hundred fifty-one billion, one hundred one million, ten thousand, six hundred thirteen".