Search a number
-
+
107513161 = 727895507
BaseRepresentation
bin1100110100010…
…00010101001001
321111022020022221
412122020111021
5210010410121
614400214041
72443563310
oct632102511
9244266287
10107513161
1155763258
123000a321
1319374472
14103c9277
15968ab41
hex6688549

107513161 has 8 divisors (see below), whose sum is σ = 122938560. Its totient is φ = 92104368.

The previous prime is 107513149. The next prime is 107513167. The reversal of 107513161 is 161315701.

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 107513161 - 27 = 107513033 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2107513161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 8303.

The product of its (nonzero) digits is 630, while the sum is 25.

The square root of 107513161 is about 10368.8553370177. The cubic root of 107513161 is about 475.5036740424.

Adding to 107513161 its reverse (161315701), we get a palindrome (268828862).

The spelling of 107513161 in words is "one hundred seven million, five hundred thirteen thousand, one hundred sixty-one".

Divisors: 1 7 2789 5507 19523 38549 15359023 107513161