Search a number
-
+
52767131 is a prime number
BaseRepresentation
bin1100100101001…
…0100110011011
310200021211220012
43021102212123
5102002022011
65122552135
71210341014
oct311224633
9120254805
1052767131
11278707aa
121580864b
13ac16a71
14701800b
154974a8b
hex325299b

52767131 has 2 divisors, whose sum is σ = 52767132. Its totient is φ = 52767130.

The previous prime is 52767109. The next prime is 52767139. The reversal of 52767131 is 13176725.

52767131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 52767131 - 26 = 52767067 is a prime.

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

It is a Sophie Germain prime.

It is a Chen prime.

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

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

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

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

Almost surely, 252767131 is an apocalyptic number.

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

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

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

The product of its digits is 8820, while the sum is 32.

The square root of 52767131 is about 7264.0987741082. The cubic root of 52767131 is about 375.0776277812.

The spelling of 52767131 in words is "fifty-two million, seven hundred sixty-seven thousand, one hundred thirty-one".