10151115001 has 4 divisors (see below), whose sum is σ = 10174667904. Its totient is φ = 10127562100.

The previous prime is 10151114917. The next prime is 10151115017. The reversal of 10151115001 is 10051115101.

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

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: 10051115101 = 2351 ⋅4275251.

It is a cyclic number.

It is not a de Polignac number, because 10151115001 - 2⁹ = 10151114489 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2^10151115001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 23552902.

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

The spelling of 10151115001 in words is "ten billion, one hundred fifty-one million, one hundred fifteen thousand, one".