Search a number
17161 = 1312
BaseRepresentation
bin100001100001001
3212112121
410030021
51022121
6211241
7101014
oct41411
925477
1017161
1111991
129b21
137a71
14637b
155141
hex4309

17161 has 3 divisors (see below), whose sum is σ = 17293. Its totient is φ = 17030.

The previous prime is 17159. The next prime is 17167. The reversal of 17161 is 16171.

17161 = T130 + T131.

The square root of 17161 is 131.

It is a perfect power (a square), and thus also a powerful number.

It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 16171 = 103157.

It is not a de Polignac number, because 17161 - 21 = 17159 is a prime.

It is a Duffinian number.

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

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

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

217161 is an apocalyptic number.

17161 is the 131-st square number.

17161 is the 66-th centered octagonal number.

It is an amenable number.

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

17161 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its digits is 42, while the sum is 16.

The cubic root of 17161 is about 25.7937328286.

Multiplying 17161 by its sum of digits (16), we get a square (274576 = 5242).

Subtracting from 17161 its reverse (16171), we obtain a triangular number (990 = T44).

It can be divided in two parts, 171 and 61, that added together give a palindrome (232).

The spelling of 17161 in words is "seventeen thousand, one hundred sixty-one".

Divisors: 1 131 17161