Search a number
-
+
10961132 = 2271330113
BaseRepresentation
bin101001110100…
…000011101100
3202121212211212
4221310003230
510301224012
61030533552
7162111440
oct51640354
922555755
1010961132
116207296
1238072b8
13236a1a0
141654820
15e67b22
hexa740ec

10961132 has 24 divisors (see below), whose sum is σ = 23609376. Its totient is φ = 4336128.

The previous prime is 10961131. The next prime is 10961143. The reversal of 10961132 is 23116901.

It is a happy number.

It is a Smith number, since the sum of its digits (23) coincides with the sum of the digits of its prime factors.

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

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

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

Almost surely, 210961132 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The square root of 10961132 is about 3310.7600335875. The cubic root of 10961132 is about 222.1357555083.

The spelling of 10961132 in words is "ten million, nine hundred sixty-one thousand, one hundred thirty-two".

Divisors: 1 2 4 7 13 14 26 28 52 91 182 364 30113 60226 120452 210791 391469 421582 782938 843164 1565876 2740283 5480566 10961132