[go: up one dir, main page]

Search a number
-
+
10609367 is a prime number
BaseRepresentation
bin101000011110…
…001011010111
3201222000022112
4220132023113
510203444432
61015221235
7156115046
oct50361327
921860275
1010609367
115a96a7a
12367781b
132276042
1415a255d
15de87b2
hexa1e2d7

10609367 has 2 divisors, whose sum is σ = 10609368. Its totient is φ = 10609366.

The previous prime is 10609351. The next prime is 10609369. The reversal of 10609367 is 76390601.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10609367 - 24 = 10609351 is a prime.

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

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

It is a Chen prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (10609369) 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, 5304683 + 5304684.

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

Almost surely, 210609367 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 6804, while the sum is 32.

The square root of 10609367 is about 3257.2023271513. The cubic root of 10609367 is about 219.7336100753.

Adding to 10609367 its reverse (76390601), we get a palindrome (86999968).

The spelling of 10609367 in words is "ten million, six hundred nine thousand, three hundred sixty-seven".