Search a number
-
+
246809261 is a prime number
BaseRepresentation
bin11101011011000…
…00001010101101
3122012102012122202
432231200022231
51001140344021
640253551245
76054562346
oct1655401255
9565365582
10246809261
111173544a6
126a7a5525
133c1962aa
1424ac90cd
1516a03a0b
hexeb602ad

246809261 has 2 divisors, whose sum is σ = 246809262. Its totient is φ = 246809260.

The previous prime is 246809257. The next prime is 246809263. The reversal of 246809261 is 162908642.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 243953161 + 2856100 = 15619^2 + 1690^2 .

It is a cyclic number.

It is not a de Polignac number, because 246809261 - 22 = 246809257 is a prime.

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

It is a Sophie Germain prime.

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

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 (246809263) by changing a digit.

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

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

Almost surely, 2246809261 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 246809261 is about 15710.1642575754. The cubic root of 246809261 is about 627.2689887890.

The spelling of 246809261 in words is "two hundred forty-six million, eight hundred nine thousand, two hundred sixty-one".