Search a number
-
+
10559127 = 331113539
BaseRepresentation
bin101000010001…
…111010010111
3201212110101210
4220101322113
510200343002
61014152503
7155515425
oct50217227
921773353
1010559127
115a62257
123652733
132259207
14158c115
15dd896c
hexa11e97

10559127 has 8 divisors (see below), whose sum is σ = 14533120. Its totient is φ = 6812280.

The previous prime is 10559119. The next prime is 10559141. The reversal of 10559127 is 72195501.

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

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

It is not a de Polignac number, because 10559127 - 23 = 10559119 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 10559094 and 10559103.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10559147) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56677 + ... + 56862.

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

Almost surely, 210559127 is an apocalyptic number.

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

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

10559127 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 113573.

The product of its (nonzero) digits is 3150, while the sum is 30.

The square root of 10559127 is about 3249.4810354886. The cubic root of 10559127 is about 219.3862161780.

The spelling of 10559127 in words is "ten million, five hundred fifty-nine thousand, one hundred twenty-seven".

Divisors: 1 3 31 93 113539 340617 3519709 10559127