Search a number
-
+
10690173 = 321391369
BaseRepresentation
bin101000110001…
…111001111101
3202010010011100
4220301321331
510214041143
61021043313
7156602454
oct50617175
922103140
1010690173
11604175a
1236b6539
1322a3a60
1415c3b9b
15e126d3
hexa31e7d

10690173 has 12 divisors (see below), whose sum is σ = 16629340. Its totient is φ = 6578496.

The previous prime is 10690159. The next prime is 10690177. The reversal of 10690173 is 37109601.

It can be written as a sum of positive squares in 2 ways, for example, as 6140484 + 4549689 = 2478^2 + 2133^2 .

It is not a de Polignac number, because 10690173 - 24 = 10690157 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10690177) by changing a digit.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 45568 + ... + 45801.

Almost surely, 210690173 is an apocalyptic number.

10690173 is a gapful number since it is divisible by the number (13) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 91388 (or 91385 counting only the distinct ones).

The product of its (nonzero) digits is 1134, while the sum is 27.

The square root of 10690173 is about 3269.5830009345. The cubic root of 10690173 is about 220.2900650461.

Adding to 10690173 its reverse (37109601), we get a palindrome (47799774).

The spelling of 10690173 in words is "ten million, six hundred ninety thousand, one hundred seventy-three".

Divisors: 1 3 9 13 39 117 91369 274107 822321 1187797 3563391 10690173