Search a number
-
+
9705141 = 329711117
BaseRepresentation
bin100101000001…
…011010110101
3200021001221200
4211001122311
54441031031
6544003113
7145330605
oct45013265
920231850
109705141
115529686
123300499
13201a5b4
141408c05
15cba8e6
hex9416b5

9705141 has 12 divisors (see below), whose sum is σ = 14164332. Its totient is φ = 6402816.

The previous prime is 9705133. The next prime is 9705167. The reversal of 9705141 is 1415079.

It can be written as a sum of positive squares in 2 ways, for example, as 2528100 + 7177041 = 1590^2 + 2679^2 .

It is not a de Polignac number, because 9705141 - 23 = 9705133 is a prime.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 29705141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 11220 (or 11217 counting only the distinct ones).

The product of its (nonzero) digits is 1260, while the sum is 27.

The square root of 9705141 is about 3115.3075289608. The cubic root of 9705141 is about 213.3047940881.

The spelling of 9705141 in words is "nine million, seven hundred five thousand, one hundred forty-one".

Divisors: 1 3 9 97 291 873 11117 33351 100053 1078349 3235047 9705141