Search a number
-
+
109157061 = 3132798899
BaseRepresentation
bin1101000000110…
…01101011000101
321121101202100010
412200121223011
5210421011221
614455340433
72463551106
oct640315305
9247352303
10109157061
1156686352
1230681719
13197cb7a0
14106d63ad
1598b2c76
hex6819ac5

109157061 has 8 divisors (see below), whose sum is σ = 156738400. Its totient is φ = 67173552.

The previous prime is 109157053. The next prime is 109157089. The reversal of 109157061 is 160751901.

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

It is not a de Polignac number, because 109157061 - 23 = 109157053 is a prime.

It is a congruent number.

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

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

Almost surely, 2109157061 is an apocalyptic number.

It is an amenable number.

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

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

109157061 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 2798915.

The product of its (nonzero) digits is 1890, while the sum is 30.

The square root of 109157061 is about 10447.8256589589. The cubic root of 109157061 is about 477.9149446299.

The spelling of 109157061 in words is "one hundred nine million, one hundred fifty-seven thousand, sixty-one".

Divisors: 1 3 13 39 2798899 8396697 36385687 109157061