Search a number
-
+
10105565 = 517611949
BaseRepresentation
bin100110100011…
…001011011101
3201000102020012
4212203023131
510041334230
61000333005
7151616201
oct46431335
921012205
1010105565
115782508
123474165
13212a932
1414b0b01
15d49395
hex9a32dd

10105565 has 16 divisors (see below), whose sum is σ = 13057200. Its totient is φ = 7480320.

The previous prime is 10105553. The next prime is 10105567. The reversal of 10105565 is 56550101.

It can be written as a sum of positive squares in 8 ways, for example, as 37636 + 10067929 = 194^2 + 3173^2 .

It is not a de Polignac number, because 10105565 - 28 = 10105309 is a 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 10105565.

It is a congruent number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4211 + ... + 6159.

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

Almost surely, 210105565 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2032.

The product of its (nonzero) digits is 750, while the sum is 23.

The square root of 10105565 is about 3178.9251328083. The cubic root of 10105565 is about 216.1989265377.

Adding to 10105565 its reverse (56550101), we get a palindrome (66655666).

The spelling of 10105565 in words is "ten million, one hundred five thousand, five hundred sixty-five".

Divisors: 1 5 17 61 85 305 1037 1949 5185 9745 33133 118889 165665 594445 2021113 10105565