Search a number
-
+
10690781 is a prime number
BaseRepresentation
bin101000110010…
…000011011101
3202010010222212
4220302003131
510214101111
61021050205
7156604313
oct50620335
922103885
1010690781
116042162
1236b6965
1322a410a
1415c40b3
15e1298b
hexa320dd

10690781 has 2 divisors, whose sum is σ = 10690782. Its totient is φ = 10690780.

The previous prime is 10690751. The next prime is 10690783. The reversal of 10690781 is 18709601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10666756 + 24025 = 3266^2 + 155^2 .

It is a cyclic number.

It is not a de Polignac number, because 10690781 - 26 = 10690717 is a prime.

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

Together with 10690783, 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 (10690783) by changing a digit.

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

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

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

Almost surely, 210690781 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 10690781 is about 3269.6759778302. The cubic root of 10690781 is about 220.2942412747.

The spelling of 10690781 in words is "ten million, six hundred ninety thousand, seven hundred eighty-one".