Search a number
-
+
55485697 is a prime number
BaseRepresentation
bin1101001110101…
…0010100000001
310212101222001211
43103222110001
5103201020242
65301130121
71242422611
oct323522401
9125358054
1055485697
1129358253
12166b9941
13b659297
147524a41
154d10317
hex34ea501

55485697 has 2 divisors, whose sum is σ = 55485698. Its totient is φ = 55485696.

The previous prime is 55485679. The next prime is 55485701. The reversal of 55485697 is 79658455.

Together with previous prime (55485679) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 40462321 + 15023376 = 6361^2 + 3876^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-55485697 is a prime.

It is a Chen prime.

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

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

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

Almost surely, 255485697 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1512000, while the sum is 49.

The square root of 55485697 is about 7448.8721965140. The cubic root of 55485697 is about 381.4114109331.

The spelling of 55485697 in words is "fifty-five million, four hundred eighty-five thousand, six hundred ninety-seven".