Search a number
-
+
55804757 is a prime number
BaseRepresentation
bin1101010011100…
…0001101010101
310220000011201212
43110320031111
5103241223012
65312031205
71245222041
oct324701525
9126004655
1055804757
1129555a38
1216832505
13b73b588
1475a9021
154d74b22
hex3538355

55804757 has 2 divisors, whose sum is σ = 55804758. Its totient is φ = 55804756.

The previous prime is 55804753. The next prime is 55804759. The reversal of 55804757 is 75740855.

55804757 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., 44609041 + 11195716 = 6679^2 + 3346^2 .

It is a cyclic number.

It is not a de Polignac number, because 55804757 - 22 = 55804753 is a prime.

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

Together with 55804759, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 255804757 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 196000, while the sum is 41.

The square root of 55804757 is about 7470.2581615363. The cubic root of 55804757 is about 382.1410921297.

The spelling of 55804757 in words is "fifty-five million, eight hundred four thousand, seven hundred fifty-seven".