Search a number
-
+
48593141 is a prime number
BaseRepresentation
bin1011100101011…
…1100011110101
310101102210020222
42321113203311
544414440031
64453304125
71130014652
oct271274365
9111383228
1048593141
112547a823
1214335045
13a0b4c4c
14664cc29
1543ece7b
hex2e578f5

48593141 has 2 divisors, whose sum is σ = 48593142. Its totient is φ = 48593140.

The previous prime is 48593131. The next prime is 48593147. The reversal of 48593141 is 14139584.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 36663025 + 11930116 = 6055^2 + 3454^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-48593141 is a prime.

It is a super-2 number, since 2×485931412 = 4722586704491762, which contains 22 as substring.

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (48593147) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24296570 + 24296571.

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

Almost surely, 248593141 is an apocalyptic number.

It is an amenable number.

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

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

48593141 is an evil number, because the sum of its binary digits is even.

The product of its digits is 17280, while the sum is 35.

The square root of 48593141 is about 6970.8780652081. The cubic root of 48593141 is about 364.9149510981.

It can be divided in two parts, 4859 and 3141, that added together give a cube (8000 = 203).

The spelling of 48593141 in words is "forty-eight million, five hundred ninety-three thousand, one hundred forty-one".