Search a number
-
+
10690765 = 518111813
BaseRepresentation
bin101000110010…
…000011001101
3202010010222021
4220302003031
510214101030
61021050141
7156604261
oct50620315
922103867
1010690765
116042148
1236b6951
1322a40c7
1415c40a1
15e1297a
hexa320cd

10690765 has 8 divisors (see below), whose sum is σ = 12900888. Its totient is φ = 8504640.

The previous prime is 10690751. The next prime is 10690781. The reversal of 10690765 is 56709601.

It can be written as a sum of positive squares in 4 ways, for example, as 56644 + 10634121 = 238^2 + 3261^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is a de Polignac number, because none of the positive numbers 2k-10690765 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 10690765.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5002 + ... + 6811.

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

Almost surely, 210690765 is an apocalyptic number.

It is an amenable number.

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

10690765 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 11999.

The product of its (nonzero) digits is 11340, while the sum is 34.

The square root of 10690765 is about 3269.6735311037. The cubic root of 10690765 is about 220.2941313760.

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

Divisors: 1 5 181 905 11813 59065 2138153 10690765