Search a number
-
+
105215913 = 32112791223
BaseRepresentation
bin1100100010101…
…11011110101001
321022222112002200
412101113132221
5203413402123
614235050413
72415214635
oct621273651
9238875080
10105215913
1154434300
122b2a0a09
1318a4b94a
14dd8bdc5
159385143
hex64577a9

105215913 has 36 divisors (see below), whose sum is σ = 169303680. Its totient is φ = 62908560.

The previous prime is 105215909. The next prime is 105215917. The reversal of 105215913 is 319512501.

It is an interprime number because it is at equal distance from previous prime (105215909) and next prime (105215917).

It is not a de Polignac number, because 105215913 - 22 = 105215909 is a prime.

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

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

It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 85420 + ... + 86642.

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

Almost surely, 2105215913 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The square root of 105215913 is about 10257.4808310813. The cubic root of 105215913 is about 472.0925453529.

The spelling of 105215913 in words is "one hundred five million, two hundred fifteen thousand, nine hundred thirteen".

Divisors: 1 3 9 11 33 79 99 121 237 363 711 869 1089 1223 2607 3669 7821 9559 11007 13453 28677 40359 86031 96617 121077 147983 289851 443949 869553 1062787 1331847 3188361 9565083 11690657 35071971 105215913