Search a number
-
+
55145137 is a prime number
BaseRepresentation
bin1101001001011…
…1001010110001
310211202122220111
43102113022301
5103104121022
65245541321
71236503665
oct322271261
9124678814
1055145137
11291453a3
1216574841
13b56a278
1474768a5
154c94477
hex34972b1

55145137 has 2 divisors, whose sum is σ = 55145138. Its totient is φ = 55145136.

The previous prime is 55145071. The next prime is 55145183. The reversal of 55145137 is 73154155.

55145137 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 can be written as a sum of positive squares in only one way, i.e., 49617936 + 5527201 = 7044^2 + 2351^2 .

It is a cyclic number.

It is not a de Polignac number, because 55145137 - 211 = 55143089 is a prime.

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

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

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

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

Almost surely, 255145137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 10500, while the sum is 31.

The square root of 55145137 is about 7425.9771747562. The cubic root of 55145137 is about 380.6294668745.

The spelling of 55145137 in words is "fifty-five million, one hundred forty-five thousand, one hundred thirty-seven".