Search a number
-
+
10690367 is a prime number
BaseRepresentation
bin101000110001…
…111100111111
3202010010102112
4220301330333
510214042432
61021044235
7156603152
oct50617477
922103375
1010690367
116041916
1236b667b
1322a3b7c
1415c3c99
15e127b2
hexa31f3f

10690367 has 2 divisors, whose sum is σ = 10690368. Its totient is φ = 10690366.

The previous prime is 10690363. The next prime is 10690409. The reversal of 10690367 is 76309601.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10690367 - 22 = 10690363 is a prime.

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

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 210690367 is an apocalyptic number.

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

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

10690367 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 10690367 is about 3269.6126681918. The cubic root of 10690367 is about 220.2913976099.

Adding to 10690367 its reverse (76309601), we get a palindrome (86999968).

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