Search a number
-
+
109161 = 3313311
BaseRepresentation
bin11010101001101001
312112202000
4122221221
511443121
62201213
7633153
oct325151
9175660
10109161
1175018
1253209
133a8c0
142bad3
1522526
hex1aa69

109161 has 16 divisors (see below), whose sum is σ = 174720. Its totient is φ = 66960.

The previous prime is 109159. The next prime is 109169. The reversal of 109161 is 161901.

It is not a de Polignac number, because 109161 - 21 = 109159 is a prime.

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

It is a Smith number, since the sum of its digits (18) coincides with the sum of the digits of its prime factors.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 196 + ... + 506.

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

2109161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 333 (or 327 counting only the distinct ones).

The product of its (nonzero) digits is 54, while the sum is 18.

The square root of 109161 is about 330.3952178831. The cubic root of 109161 is about 47.7920693179.

The spelling of 109161 in words is "one hundred nine thousand, one hundred sixty-one".

Divisors: 1 3 9 13 27 39 117 311 351 933 2799 4043 8397 12129 36387 109161