106913 has 8 divisors (see below), whose sum is σ = 119520. Its totient is φ = 95040.

The previous prime is 106907. The next prime is 106921. The reversal of 106913 is 319601.

106913 is nontrivially palindromic in base 16.

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

It is a cyclic number.

It is not a de Polignac number, because 106913 - 2⁸ = 106657 is a prime.

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

It is a Duffinian number.

106913 is an undulating number in base 16.

It is a Curzon number.

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 106913.

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

It is a pernicious number, because its binary representation contains a prime number (7) of ones.

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

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

2¹⁰⁶⁹¹³ is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 367.

The product of its (nonzero) digits is 162, while the sum is 20.

The square root of 106913 is about 326.9755342529. The cubic root of 106913 is about 47.4617235503.

The spelling of 106913 in words is "one hundred six thousand, nine hundred thirteen".