48563939 has 2 divisors, whose sum is σ = 48563940. Its totient is φ = 48563938.

The previous prime is 48563909. The next prime is 48563993. The reversal of 48563939 is 93936584.

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

Together with next prime (48563993) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 48563939 - 2¹⁶ = 48498403 is a prime.

It is a Chen prime.

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

It is not a weakly prime, because it can be changed into another prime (48563909) 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, 24281969 + 24281970.

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

Almost surely, 2^48563939 is an apocalyptic number.

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

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

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

The product of its digits is 699840, while the sum is 47.

The square root of 48563939 is about 6968.7831792932. The cubic root of 48563939 is about 364.8418380241.

The spelling of 48563939 in words is "forty-eight million, five hundred sixty-three thousand, nine hundred thirty-nine".