48911013 has 8 divisors (see below), whose sum is σ = 72460800. Its totient is φ = 32607324.

The previous prime is 48911011. The next prime is 48911017. The reversal of 48911013 is 31011984.

48911013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 48911013 - 2¹ = 48911011 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 1811519 = 48911013 / (4 + 8 + 9 + 1 + 1 + 0 + 1 + 3).

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 2^48911013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1811528 (or 1811522 counting only the distinct ones).

The product of its (nonzero) digits is 864, while the sum is 27.

The square root of 48911013 is about 6993.6408972723. The cubic root of 48911013 is about 365.7089193301.

Adding to 48911013 its reverse (31011984), we get a palindrome (79922997).

The spelling of 48911013 in words is "forty-eight million, nine hundred eleven thousand, thirteen".