Search a number
-
+
10330565 = 572341313
BaseRepresentation
bin100111011010…
…000111000101
3201102211212112
4213122013011
510121034230
61005230405
7153544160
oct47320705
921384775
1010330565
115916563
123562405
1321a917b
14152cad7
15d90d95
hex9da1c5

10330565 has 32 divisors (see below), whose sum is σ = 15192576. Its totient is φ = 6589440.

The previous prime is 10330559. The next prime is 10330603. The reversal of 10330565 is 56503301.

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

It is not a de Polignac number, because 10330565 - 26 = 10330501 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (23).

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 10330565.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 32849 + ... + 33161.

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

Almost surely, 210330565 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 389.

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

The square root of 10330565 is about 3214.1196306298. The cubic root of 10330565 is about 217.7917167274.

Adding to 10330565 its reverse (56503301), we get a palindrome (66833866).

The spelling of 10330565 in words is "ten million, three hundred thirty thousand, five hundred sixty-five".

Divisors: 1 5 7 23 35 41 115 161 205 287 313 805 943 1435 1565 2191 4715 6601 7199 10955 12833 33005 35995 50393 64165 89831 251965 295159 449155 1475795 2066113 10330565