Search a number
BaseRepresentation
bin10100101000111
3112111101
42211013
5314232
6120531
742544
oct24507
915441
1010567
117a37
126147
134a6b
143bcb
1531e7
hex2947

10567 has 2 divisors, whose sum is σ = 10568. Its totient is φ = 10566.

The previous prime is 10559. The next prime is 10589. The reversal of 10567 is 76501.

10567 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10567 - 23 = 10559 is a prime.

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

It is an Ulam number.

It is an alternating number because its digits alternate between odd and even.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (10597) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (7) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5283 + 5284.

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

210567 is an apocalyptic number.

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

10567 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The square root of 10567 is about 102.7959143157. The cubic root of 10567 is about 21.9440728215.

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