Search a number
-
+
9641052 = 223389269
BaseRepresentation
bin100100110001…
…110001011100
3200010211001000
4210301301130
54432003202
6542350300
7144643011
oct44616134
920124030
109641052
115495513
12328b390
131cc7385
1413cd708
15ca691c
hex931c5c

9641052 has 24 divisors (see below), whose sum is σ = 24995600. Its totient is φ = 3213648.

The previous prime is 9641041. The next prime is 9641069. The reversal of 9641052 is 2501469.

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

It is a congruent number.

It is an unprimeable number.

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, 44527 + ... + 44742.

Almost surely, 29641052 is an apocalyptic number.

It is an amenable number.

9641052 is an abundant number, since it is smaller than the sum of its proper divisors (15354548).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

The square root of 9641052 is about 3105.0043478230. The cubic root of 9641052 is about 212.8342292820.

Subtracting from 9641052 its sum of digits (27), we obtain a square (9641025 = 31052).

It can be divided in two parts, 964 and 1052, that added together give a triangular number (2016 = T63).

The spelling of 9641052 in words is "nine million, six hundred forty-one thousand, fifty-two".

Divisors: 1 2 3 4 6 9 12 18 27 36 54 108 89269 178538 267807 357076 535614 803421 1071228 1606842 2410263 3213684 4820526 9641052