Search a number
-
+
48610141 is a prime number
BaseRepresentation
bin1011100101101…
…1101101011101
310101110122120121
42321123231131
544421011031
64453514541
71130115346
oct271335535
9111418517
1048610141
1125491578
1214342a51
13a0bc8c8
1466550cd
154403011
hex2e5bb5d

48610141 has 2 divisors, whose sum is σ = 48610142. Its totient is φ = 48610140.

The previous prime is 48610127. The next prime is 48610153. The reversal of 48610141 is 14101684.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 48580900 + 29241 = 6970^2 + 171^2 .

It is a cyclic number.

It is not a de Polignac number, because 48610141 - 27 = 48610013 is a prime.

It is a congruent number.

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

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

Almost surely, 248610141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 768, while the sum is 25.

The square root of 48610141 is about 6972.0973171636. The cubic root of 48610141 is about 364.9575005249.

It can be divided in two parts, 486101 and 41, that multiplied together give a triangular number (19930141 = T6313).

The spelling of 48610141 in words is "forty-eight million, six hundred ten thousand, one hundred forty-one".