Search a number
-
+
11015961 = 311230347
BaseRepresentation
bin101010000001…
…011100011001
3202201200001120
4222001130121
510310002321
61032035453
7162430335
oct52013431
922650046
1011015961
116244500
123832b89
132389128
14166a7c5
15e78ec6
hexa81719

11015961 has 12 divisors (see below), whose sum is σ = 16145136. Its totient is φ = 6676120.

The previous prime is 11015959. The next prime is 11015981. The reversal of 11015961 is 16951011.

It is not a de Polignac number, because 11015961 - 21 = 11015959 is a prime.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14811 + ... + 15536.

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

Almost surely, 211015961 is an apocalyptic number.

11015961 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 270, while the sum is 24.

The square root of 11015961 is about 3319.0301294203. The cubic root of 11015961 is about 222.5055235762.

Adding to 11015961 its reverse (16951011), we get a palindrome (27966972).

The spelling of 11015961 in words is "eleven million, fifteen thousand, nine hundred sixty-one".

Divisors: 1 3 11 33 121 363 30347 91041 333817 1001451 3671987 11015961