Search a number
-
+
27290567 is a prime number
BaseRepresentation
bin110100000011…
…0101111000111
31220100111121202
41220012233013
523441244232
62412533115
7450652223
oct150065707
956314552
1027290567
111444a897
12918119b
135866985
1438a5783
1525e1162
hex1a06bc7

27290567 has 2 divisors, whose sum is σ = 27290568. Its totient is φ = 27290566.

The previous prime is 27290563. The next prime is 27290569. The reversal of 27290567 is 76509272.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 27290567 - 22 = 27290563 is a prime.

Together with 27290569, it forms a pair of twin primes.

It is a Chen prime.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 227290567 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 52920, while the sum is 38.

The square root of 27290567 is about 5224.0374232963. The cubic root of 27290567 is about 301.0723364886.

The spelling of 27290567 in words is "twenty-seven million, two hundred ninety thousand, five hundred sixty-seven".