Search a number
-
+
53079137 is a prime number
BaseRepresentation
bin1100101001111…
…0110001100001
310200212200212222
43022132301201
5102042013022
65133400425
71213110446
oct312366141
9120780788
1053079137
1127a64161
1215939115
13acc5a97
1470999cd
1549d7242
hex329ec61

53079137 has 2 divisors, whose sum is σ = 53079138. Its totient is φ = 53079136.

The previous prime is 53079119. The next prime is 53079163. The reversal of 53079137 is 73197035.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 37405456 + 15673681 = 6116^2 + 3959^2 .

It is a cyclic number.

It is not a de Polignac number, because 53079137 - 212 = 53075041 is a prime.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 53079097 and 53079106.

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

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

Almost surely, 253079137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 19845, while the sum is 35.

The square root of 53079137 is about 7285.5430133930. The cubic root of 53079137 is about 375.8154391683.

The spelling of 53079137 in words is "fifty-three million, seventy-nine thousand, one hundred thirty-seven".