Search a number
-
+
55902565 = 514975037
BaseRepresentation
bin1101010101000…
…0000101100101
310220012010220101
43111100011211
5103302340230
65314104101
71246110145
oct325200545
9126163811
1055902565
1129612474
121687b031
13b773c54
1475d2925
154d93aca
hex3550165

55902565 has 8 divisors (see below), whose sum is σ = 67534200. Its totient is φ = 44421312.

The previous prime is 55902563. The next prime is 55902607. The reversal of 55902565 is 56520955.

It can be written as a sum of positive squares in 4 ways, for example, as 1747684 + 54154881 = 1322^2 + 7359^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 55902565 - 21 = 55902563 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (55902563) 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 in 7 ways as a sum of consecutive naturals, for example, 36774 + ... + 38263.

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

Almost surely, 255902565 is an apocalyptic number.

It is an amenable number.

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

55902565 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 75191.

The product of its (nonzero) digits is 67500, while the sum is 37.

The square root of 55902565 is about 7476.8017895354. The cubic root of 55902565 is about 382.3642191104.

The spelling of 55902565 in words is "fifty-five million, nine hundred two thousand, five hundred sixty-five".

Divisors: 1 5 149 745 75037 375185 11180513 55902565