Search a number
-
+
49019627 is a prime number
BaseRepresentation
bin1011101011111…
…1101011101011
310102020110021202
42322333223223
5100022112002
64510354415
71133442236
oct272775353
9112213252
1049019627
1125741198
12144bba0b
13a2040c7
14672041d
154484502
hex2ebfaeb

49019627 has 2 divisors, whose sum is σ = 49019628. Its totient is φ = 49019626.

The previous prime is 49019569. The next prime is 49019671. The reversal of 49019627 is 72691094.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 49019627 - 216 = 48954091 is a prime.

It is a Chen prime.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 249019627 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 27216, while the sum is 38.

The square root of 49019627 is about 7001.4017882136. The cubic root of 49019627 is about 365.9794224349.

The spelling of 49019627 in words is "forty-nine million, nineteen thousand, six hundred twenty-seven".