10005151 has 4 divisors (see below), whose sum is σ = 10774792. Its totient is φ = 9235512.

The previous prime is 10005143. The next prime is 10005167. The reversal of 10005151 is 15150001.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 10005151 - 2³ = 10005143 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (13), and also a Moran number because the ratio is a prime number: 769627 = 10005151 / (1 + 0 + 0 + 0 + 5 + 1 + 5 + 1).

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 2^10005151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 769640.

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

The square root of 10005151 is about 3163.0919999267. The cubic root of 10005151 is about 215.4804542972.

Adding to 10005151 its reverse (15150001), we get a palindrome (25155152).

The spelling of 10005151 in words is "ten million, five thousand, one hundred fifty-one".