Search a number
BaseRepresentation
bin1010000101001
321002011
41100221
5131121
635521
721022
oct12051
97064
105161
113972
122ba1
132470
141c49
1517e1
hex1429

5161 has 4 divisors (see below), whose sum is σ = 5572. Its totient is φ = 4752.

The previous prime is 5153. The next prime is 5167. The reversal of 5161 is 1615.

Adding to 5161 its reverse (1615), we get a palindrome (6776).

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 2025 + 3136 = 45^2 + 56^2 .

It is a cyclic number.

It is not a de Polignac number, because 5161 - 23 = 5153 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (13), and also a Moran number because the ratio is a prime number: 397 = 5161 / (5 + 1 + 6 + 1).

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (5167) 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 3 ways as a sum of consecutive naturals, for example, 186 + ... + 211.

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

25161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 410.

The product of its digits is 30, while the sum is 13.

The square root of 5161 is about 71.8401002226. The cubic root of 5161 is about 17.2813614182.

The spelling of 5161 in words is "five thousand, one hundred sixty-one".

Divisors: 1 13 397 5161