51251015215 has 4 divisors (see below), whose sum is σ = 61501218264. Its totient is φ = 41000812168.

The previous prime is 51251015209. The next prime is 51251015219.

51251015215 is nontrivially palindromic in base 10.

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 51251015215 - 2⁷ = 51251015087 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2^51251015215 is an apocalyptic number.

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

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

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

The sum of its prime factors is 10250203048.

The product of its (nonzero) digits is 2500, while the sum is 28.

It can be divided in two parts, 512510 and 15215, that added together give a palindrome (527725).

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