106515127 has 4 divisors (see below), whose sum is σ = 107492440. Its totient is φ = 105537816.

The previous prime is 106515091. The next prime is 106515131. The reversal of 106515127 is 721515601.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 721515601 = 1871 ⋅385631.

It is a cyclic number.

It is not a de Polignac number, because 106515127 - 2¹¹ = 106513079 is a prime.

It is a super-2 number, since 2×106515127² = 22690944559652258, which contains 22 as substring.

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 488493 + ... + 488710.

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

Almost surely, 2^106515127 is an apocalyptic number.

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

106515127 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 977312.

The product of its (nonzero) digits is 2100, while the sum is 28.

The square root of 106515127 is about 10320.6165997967. The cubic root of 106515127 is about 474.0277464812.

The spelling of 106515127 in words is "one hundred six million, five hundred fifteen thousand, one hundred twenty-seven".