Search a number
BaseRepresentation
bin10101001100010101101111
3101110020210202
4111030111233
52410234232
6315024115
765135663
oct25142557
911406722
105555567
113154a86
121a3b03b
1311c6924
14a488a3
1574b162
hex54c56f

5555567 has 2 divisors, whose sum is σ = 5555568. Its totient is φ = 5555566.

The previous prime is 5555527. The next prime is 5555591. The reversal of 5555567 is 7655555.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 5555567 - 220 = 4506991 is a prime.

It is a Chen prime.

It is a plaindrome in base 10.

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

It is a congruent number.

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

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

It is a good prime.

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

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

Almost surely, 25555567 is an apocalyptic number.

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

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

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

The product of its digits is 131250, while the sum is 38.

The square root of 5555567 is about 2357.0250316872. The cubic root of 5555567 is about 177.1098831457.

The spelling of 5555567 in words is "five million, five hundred fifty-five thousand, five hundred sixty-seven".