Search a number
BaseRepresentation
bin1001111110001
321000002
41033301
5130410
635345
720612
oct11761
97002
105105
113921
122b55
132429
141c09
1517a5
hex13f1

5105 has 4 divisors (see below), whose sum is σ = 6132. Its totient is φ = 4080.

The previous prime is 5101. The next prime is 5107. The reversal of 5105 is 5015.

It can be divided in two parts, 510 and 5, that added together give a palindrome (515).

5105 is nontrivially palindromic in base 4.

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 2401 + 2704 = 49^2 + 52^2 .

It is not a de Polignac number, because 5105 - 22 = 5101 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 1026.

The product of its (nonzero) digits is 25, while the sum is 11.

The square root of 5105 is about 71.4492827116. The cubic root of 5105 is about 17.2186295354.

The spelling of 5105 in words is "five thousand, one hundred five".

Divisors: 1 5 1021 5105