Search a number
-
+
107214715 = 537579539
BaseRepresentation
bin1100110001111…
…11011101111011
321110202001221101
412120333131323
5204421332330
614345552231
72441211226
oct630773573
9243661841
10107214715
115557a003
122baa5677
131929b67a
141034c5bd
15962c4ca
hex663f77b

107214715 has 8 divisors (see below), whose sum is σ = 132135120. Its totient is φ = 83453472.

The previous prime is 107214703. The next prime is 107214719. The reversal of 107214715 is 517412701.

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 107214715 - 29 = 107214203 is a prime.

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

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

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

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

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

Almost surely, 2107214715 is an apocalyptic number.

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

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

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

The sum of its prime factors is 579581.

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

The square root of 107214715 is about 10354.4538726096. The cubic root of 107214715 is about 475.0632824275.

The spelling of 107214715 in words is "one hundred seven million, two hundred fourteen thousand, seven hundred fifteen".

Divisors: 1 5 37 185 579539 2897695 21442943 107214715