Search a number
-
+
106415913 = 3237714923
BaseRepresentation
bin1100101011111…
…00011100101001
321102020111012010
412111330130221
5204220302123
614320510133
72431343322
oct625743451
9242214163
10106415913
115508393a
122b77b349
131907bbc6
14101c1449
159520993
hex657c729

106415913 has 8 divisors (see below), whose sum is σ = 141957088. Its totient is φ = 70909344.

The previous prime is 106415909. The next prime is 106415929. The reversal of 106415913 is 319514601.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 106415913 - 22 = 106415909 is a prime.

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

It is a Duffinian number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 331 + ... + 14592.

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

Almost surely, 2106415913 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 17303.

The product of its (nonzero) digits is 3240, while the sum is 30.

The square root of 106415913 is about 10315.8088873340. The cubic root of 106415913 is about 473.8805223266.

The spelling of 106415913 in words is "one hundred six million, four hundred fifteen thousand, nine hundred thirteen".

Divisors: 1 3 2377 7131 14923 44769 35471971 106415913