Search a number
-
+
10161 = 321129
BaseRepresentation
bin10011110110001
3111221100
42132301
5311121
6115013
741424
oct23661
914840
1010161
1176a8
125a69
134818
1439bb
153026
hex27b1

10161 has 6 divisors (see below), whose sum is σ = 14690. Its totient is φ = 6768.

The previous prime is 10159. The next prime is 10163. The reversal of 10161 is 16101.

Adding to 10161 its reverse (16101), we get a palindrome (26262).

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

It is an interprime number because it is at equal distance from previous prime (10159) and next prime (10163).

It can be written as a sum of positive squares in only one way, i.e., 6561 + 3600 = 81^2 + 60^2 .

It is not a de Polignac number, because 10161 - 21 = 10159 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1129 = 10161 / (1 + 0 + 1 + 6 + 1).

It is an alternating number because its digits alternate between odd and even.

It is a Duffinian number.

It is a Curzon number.

It is a plaindrome in base 14.

It is a zygodrome in base 3.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 556 + ... + 573.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 6, while the sum is 9.

The square root of 10161 is about 100.8017856985. The cubic root of 10161 is about 21.6593532187.

The spelling of 10161 in words is "ten thousand, one hundred sixty-one".

Divisors: 1 3 9 1129 3387 10161