Search a number
-
+
106938965 = 573055399
BaseRepresentation
bin1100101111111…
…00001001010101
321110020001200102
412113330021111
5204334021330
614340023445
72435652260
oct627741125
9243201612
10106938965
1155400911
122b991b85
1319202cc3
14102b9cd7
1595c5945
hex65fc255

106938965 has 8 divisors (see below), whose sum is σ = 146659200. Its totient is φ = 73329552.

The previous prime is 106938961. The next prime is 106938971. The reversal of 106938965 is 569839601.

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 106938965 - 22 = 106938961 is a prime.

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

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 2106938965 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3055411.

The product of its (nonzero) digits is 349920, while the sum is 47.

The square root of 106938965 is about 10341.1297738690. The cubic root of 106938965 is about 474.6556544015.

The spelling of 106938965 in words is "one hundred six million, nine hundred thirty-eight thousand, nine hundred sixty-five".

Divisors: 1 5 7 35 3055399 15276995 21387793 106938965