[go: up one dir, main page]

Search a number
-
+
2556605 = 53171613
BaseRepresentation
bin1001110000001010111101
311210220000002
421300022331
51123302410
6130444045
730505442
oct11601275
94726002
102556605
1114968a7
12a33625
136b68ac
144a79c9
153577a5
hex2702bd

2556605 has 8 divisors (see below), whose sum is σ = 3079512. Its totient is φ = 2037568.

The previous prime is 2556577. The next prime is 2556607. The reversal of 2556605 is 5066552.

2556605 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 4 ways, for example, as 31684 + 2524921 = 178^2 + 1589^2 .

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

It is a cyclic number.

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

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (2556607) 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, 779 + ... + 2391.

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

22556605 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1935.

The product of its (nonzero) digits is 9000, while the sum is 29.

The square root of 2556605 is about 1598.9387105202. The cubic root of 2556605 is about 136.7375763952.

The spelling of 2556605 in words is "two million, five hundred fifty-six thousand, six hundred five".

Divisors: 1 5 317 1585 1613 8065 511321 2556605