Search a number
-
+
55577969 is a prime number
BaseRepresentation
bin1101010000000…
…0110101110001
310212120122122022
43110000311301
5103211443334
65303121225
71243255616
oct324006561
9125518568
1055577969
1129410607
1216743215
13b68c295
14754a50d
154d2c82e
hex3500d71

55577969 has 2 divisors, whose sum is σ = 55577970. Its totient is φ = 55577968.

The previous prime is 55577953. The next prime is 55577971. The reversal of 55577969 is 96977555.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 27962944 + 27615025 = 5288^2 + 5255^2 .

It is a cyclic number.

It is not a de Polignac number, because 55577969 - 24 = 55577953 is a prime.

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

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 55577969.

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

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

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

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

Almost surely, 255577969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2976750, while the sum is 53.

The square root of 55577969 is about 7455.0633129438. The cubic root of 55577969 is about 381.6227212634.

The spelling of 55577969 in words is "fifty-five million, five hundred seventy-seven thousand, nine hundred sixty-nine".