5051200215 has 32 divisors (see below), whose sum is σ = 8370210816. Its totient is φ = 2599493120.

The previous prime is 5051200211. The next prime is 5051200261. The reversal of 5051200215 is 5120021505.

It is not a de Polignac number, because 5051200215 - 2² = 5051200211 is a prime.

It is a super-2 number, since 2×5051200215² = 51029247224032092450, which contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 5051200191 and 5051200200.

It is a congruent number.

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 402 + ... + 100511.

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

Almost surely, 2^5051200215 is an apocalyptic number.

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

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

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

The sum of its prime factors is 101039.

The product of its (nonzero) digits is 500, while the sum is 21.

The square root of 5051200215 is about 71071.7961993363. The cubic root of 5051200215 is about 1715.7928788245.

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