Base | Representation |
---|---|
bin | 100111010000… |
… | …1101101100101 |
3 | 1102201211202011 |
4 | 1032201231211 |
5 | 20232212232 |
6 | 2013114221 |
7 | 336654334 |
oct | 116415545 |
9 | 42654664 |
10 | 20585317 |
11 | 10690065 |
12 | 6a88971 |
13 | 435997c |
14 | 2a3bd1b |
15 | 1c19547 |
hex | 13a1b65 |
20585317 has 8 divisors (see below), whose sum is σ = 21893976. Its totient is φ = 19287552.
The previous prime is 20585293. The next prime is 20585329. The reversal of 20585317 is 71358502.
It can be written as a sum of positive squares in 4 ways, for example, as 2556801 + 18028516 = 1599^2 + 4246^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20585317 - 215 = 20552549 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20585387) 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 in 7 ways as a sum of consecutive naturals, for example, 1363 + ... + 6559.
It is an arithmetic number, because the mean of its divisors is an integer number (2736747).
Almost surely, 220585317 is an apocalyptic number.
It is an amenable number.
20585317 is a deficient number, since it is larger than the sum of its proper divisors (1308659).
20585317 is a wasteful number, since it uses less digits than its factorization.
20585317 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5447.
The product of its (nonzero) digits is 8400, while the sum is 31.
The square root of 20585317 is about 4537.1044731194. The cubic root of 20585317 is about 274.0643330212.
It can be divided in two parts, 20585 and 317, that added together give a palindrome (20902).
The spelling of 20585317 in words is "twenty million, five hundred eighty-five thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •