Search a number
-
+
48906157 is a prime number
BaseRepresentation
bin1011101010001…
…1111110101101
310102000200122011
42322203332231
5100004444112
64504121221
71132460356
oct272437655
9112020564
1048906157
1125673a13
1214466211
13a194571
1466d0d2d
154460aa7
hex2ea3fad

48906157 has 2 divisors, whose sum is σ = 48906158. Its totient is φ = 48906156.

The previous prime is 48906101. The next prime is 48906163. The reversal of 48906157 is 75160984.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 32046921 + 16859236 = 5661^2 + 4106^2 .

It is a cyclic number.

It is not a de Polignac number, because 48906157 - 27 = 48906029 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 (48906167) 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, 24453078 + 24453079.

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

Almost surely, 248906157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 60480, while the sum is 40.

The square root of 48906157 is about 6993.2937161255. The cubic root of 48906157 is about 365.6968161167.

The spelling of 48906157 in words is "forty-eight million, nine hundred six thousand, one hundred fifty-seven".