51505001151 has 4 divisors (see below), whose sum is σ = 68673334872. Its totient is φ = 34336667432.

The previous prime is 51505001147. The next prime is 51505001159. The reversal of 51505001151 is 15110050515.

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

It is a cyclic number.

It is not a de Polignac number, because 51505001151 - 2² = 51505001147 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2^51505001151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 17168333720.

The product of its (nonzero) digits is 625, while the sum is 24.

Adding to 51505001151 its reverse (15110050515), we get a palindrome (66615051666).

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