Search a number
-
+
49052147 is a prime number
BaseRepresentation
bin1011101100011…
…1100111110011
310102022002220012
42323013213303
5100024132042
64511205135
71133636114
oct273074763
9112262805
1049052147
1125763671
12145167ab
13a215b51
14672c20b
15448de82
hex2ec79f3

49052147 has 2 divisors, whose sum is σ = 49052148. Its totient is φ = 49052146.

The previous prime is 49052093. The next prime is 49052173. The reversal of 49052147 is 74125094.

It is a happy number.

It is a strong prime.

It is a cyclic number.

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

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

It is a Chen prime.

It is an alternating number because its digits alternate between even and odd.

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

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

Almost surely, 249052147 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 10080, while the sum is 32.

The square root of 49052147 is about 7003.7237952392. The cubic root of 49052147 is about 366.0603357386.

The spelling of 49052147 in words is "forty-nine million, fifty-two thousand, one hundred forty-seven".