Search a number
BaseRepresentation
bin1010110111111
321122012
41112333
5134232
641435
722142
oct12677
97565
105567
114201
12327b
1326c3
142059
1519b2
hex15bf

5567 has 4 divisors (see below), whose sum is σ = 5880. Its totient is φ = 5256.

The previous prime is 5563. The next prime is 5569. The reversal of 5567 is 7655.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 7655 = 51531.

It is a cyclic number.

It is not a de Polignac number, because 5567 - 22 = 5563 is a prime.

It is a d-powerful number, because it can be written as 5 + 62 + 55 + 74 .

It is a Duffinian number.

It is a plaindrome in base 4, base 8, base 10 and base 16.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (5563) 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, 128 + ... + 165.

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

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

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

It is an anagram of its base 9 representation: 5567 = (7565)9.

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

The sum of its prime factors is 312.

The product of its digits is 1050, while the sum is 23.

The square root of 5567 is about 74.6123314205. The cubic root of 5567 is about 17.7231293486.

The spelling of 5567 in words is "five thousand, five hundred sixty-seven".

Divisors: 1 19 293 5567