48559031 has 2 divisors, whose sum is σ = 48559032. Its totient is φ = 48559030.

The previous prime is 48559013. The next prime is 48559081. The reversal of 48559031 is 13095584.

Together with previous prime (48559013) 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 48559031 - 2⁶ = 48558967 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 2^48559031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 21600, while the sum is 35.

The square root of 48559031 is about 6968.4310285745. The cubic root of 48559031 is about 364.8295469833.

The spelling of 48559031 in words is "forty-eight million, five hundred fifty-nine thousand, thirty-one".