Search a number
BaseRepresentation
bin1010111100111
321200200
41113213
5134412
641543
722230
oct12747
97620
105607
114238
1232b3
132724
142087
1519dc
hex15e7

5607 has 12 divisors (see below), whose sum is σ = 9360. Its totient is φ = 3168.

The previous prime is 5591. The next prime is 5623. The reversal of 5607 is 7065.

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

It is not a de Polignac number, because 5607 - 24 = 5591 is a prime.

It is a nialpdrome in base 9.

It is a self number, because there is not a number n which added to its sum of digits gives 5607.

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19 + ... + 107.

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

25607 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 210, while the sum is 18.

The square root of 5607 is about 74.8799038461. The cubic root of 5607 is about 17.7654761540.

Adding to 5607 its sum of digits (18), we get a square (5625 = 752).

The spelling of 5607 in words is "five thousand, six hundred seven".

Divisors: 1 3 7 9 21 63 89 267 623 801 1869 5607