Search a number
-
+
48599597 is a prime number
BaseRepresentation
bin1011100101100…
…1001000101101
310101110010010002
42321121020231
544420141342
64453354045
71130042534
oct271311055
9111403102
1048599597
1125484662
1214338925
13a0b7b77
14665131b
1543eed32
hex2e5922d

48599597 has 2 divisors, whose sum is σ = 48599598. Its totient is φ = 48599596.

The previous prime is 48599567. The next prime is 48599609. The reversal of 48599597 is 79599584.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 27678121 + 20921476 = 5261^2 + 4574^2 .

It is a cyclic number.

It is not a de Polignac number, because 48599597 - 26 = 48599533 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 (48599527) 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, 24299798 + 24299799.

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

Almost surely, 248599597 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 4082400, while the sum is 56.

The square root of 48599597 is about 6971.3411191822. The cubic root of 48599597 is about 364.9311110372.

The spelling of 48599597 in words is "forty-eight million, five hundred ninety-nine thousand, five hundred ninety-seven".