5101101015 has 32 divisors (see below), whose sum is σ = 8671423680. Its totient is φ = 2555771904.

The previous prime is 5101101013. The next prime is 5101101029. The reversal of 5101101015 is 5101011015.

It is not a de Polignac number, because 5101101015 - 2¹ = 5101101013 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (15).

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (5101101013) 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, 142374 + ... + 174563.

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

Almost surely, 2^5101101015 is an apocalyptic number.

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

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

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

The sum of its prime factors is 317011.

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

The square root of 5101101015 is about 71421.9925163111. The cubic root of 5101101015 is about 1721.4244796439.

Subtracting from 5101101015 its reverse (5101011015), we obtain a square (90000 = 300²).

The spelling of 5101101015 in words is "five billion, one hundred one million, one hundred one thousand, fifteen".