Search a number
-
+
106515201 = 3132731159
BaseRepresentation
bin1100101100101…
…00101100000001
321102102112101110
412112110230001
5204231441301
614322553533
72432235642
oct626245401
9242375343
10106515201
11551414a1
122b8088a9
13190b5160
14102096c9
1595400d6
hex6594b01

106515201 has 8 divisors (see below), whose sum is σ = 152944960. Its totient is φ = 65547792.

The previous prime is 106515191. The next prime is 106515209. The reversal of 106515201 is 102515601.

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

It is not a de Polignac number, because 106515201 - 26 = 106515137 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (106515209) 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, 1365541 + ... + 1365618.

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

Almost surely, 2106515201 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2731175.

The product of its (nonzero) digits is 300, while the sum is 21.

The square root of 106515201 is about 10320.6201848532. The cubic root of 106515201 is about 474.0278562560.

The spelling of 106515201 in words is "one hundred six million, five hundred fifteen thousand, two hundred one".

Divisors: 1 3 13 39 2731159 8193477 35505067 106515201