Search a number
-
+
106911135 = 3254750549
BaseRepresentation
bin1100101111101…
…01010110011111
321110011122111200
412113311112133
5204332124020
614335250543
72435505162
oct627652637
9243148450
10106911135
1155391a11
122b979a53
13191c3436
14102adad9
1595bc590
hex65f559f

106911135 has 24 divisors (see below), whose sum is σ = 189259200. Its totient is φ = 55804992.

The previous prime is 106911109. The next prime is 106911173. The reversal of 106911135 is 531119601.

It is not a de Polignac number, because 106911135 - 211 = 106909087 is a prime.

It is a super-2 number, since 2×1069111352 = 22859981573976450, which contains 22 as substring.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23160 + ... + 27389.

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

Almost surely, 2106911135 is an apocalyptic number.

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

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

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

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

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

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

The square root of 106911135 is about 10339.7840886548. The cubic root of 106911135 is about 474.6144757319.

The spelling of 106911135 in words is "one hundred six million, nine hundred eleven thousand, one hundred thirty-five".

Divisors: 1 3 5 9 15 45 47 141 235 423 705 2115 50549 151647 252745 454941 758235 2274705 2375803 7127409 11879015 21382227 35637045 106911135