Search a number
-
+
206024261 is a prime number
BaseRepresentation
bin11000100011110…
…10111001000101
3112100200010011012
430101322321011
5410220234021
632235452005
75051114552
oct1421727105
9470603135
10206024261
11a6328093
1258bb7005
13338b6361
141d50da29
151314935b
hexc47ae45

206024261 has 2 divisors, whose sum is σ = 206024262. Its totient is φ = 206024260.

The previous prime is 206024257. The next prime is 206024281. The reversal of 206024261 is 162420602.

206024261 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 can be written as a sum of positive squares in only one way, i.e., 205922500 + 101761 = 14350^2 + 319^2 .

It is a cyclic number.

It is not a de Polignac number, because 206024261 - 22 = 206024257 is a prime.

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

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 2206024261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1152, while the sum is 23.

The square root of 206024261 is about 14353.5452415074. The cubic root of 206024261 is about 590.6172425696.

Adding to 206024261 its reverse (162420602), we get a palindrome (368444863).

The spelling of 206024261 in words is "two hundred six million, twenty-four thousand, two hundred sixty-one".