48511037 has 2 divisors, whose sum is σ = 48511038. Its totient is φ = 48511036.

The previous prime is 48511027. The next prime is 48511049. The reversal of 48511037 is 73011584.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 26925721 + 21585316 = 5189^2 + 4646^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-48511037 is a prime.

It is a Chen prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (48511027) 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 as a sum of consecutive naturals, namely, 24255518 + 24255519.

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

Almost surely, 2^48511037 is an apocalyptic number.

It is an amenable number.

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

48511037 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 3360, while the sum is 29.

The square root of 48511037 is about 6964.9865039352. The cubic root of 48511037 is about 364.7093125613.

The spelling of 48511037 in words is "forty-eight million, five hundred eleven thousand, thirty-seven".