Search a number
-
+
5265 = 34513
BaseRepresentation
bin1010010010001
321020000
41102101
5132030
640213
721231
oct12221
97200
105265
113a57
123069
132520
141cc1
151860
hex1491

5265 has 20 divisors (see below), whose sum is σ = 10164. Its totient is φ = 2592.

The previous prime is 5261. The next prime is 5273. The reversal of 5265 is 5625.

5265 is nontrivially palindromic in base 8 and base 14.

It can be written as a sum of positive squares in 2 ways, for example, as 1296 + 3969 = 36^2 + 63^2 .

It is not a de Polignac number, because 5265 - 22 = 5261 is a prime.

5265 is a Rhonda number in base 10.

Its product of digits (300) is a multiple of the sum of its prime factors (30).

It is a Curzon number.

It is a nialpdrome in base 9.

It is a congruent number.

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

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

It is an amenable number.

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

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

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

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

The product of its digits is 300, while the sum is 18.

The square root of 5265 is about 72.5603197347. The cubic root of 5265 is about 17.3966699929.

The spelling of 5265 in words is "five thousand, two hundred sixty-five".

Divisors: 1 3 5 9 13 15 27 39 45 65 81 117 135 195 351 405 585 1053 1755 5265