Base | Representation |
---|---|
bin | 100110100001… |
… | …1000011110001 |
3 | 1102000010220220 |
4 | 1031003003301 |
5 | 20132310432 |
6 | 2000523253 |
7 | 333451116 |
oct | 115030361 |
9 | 42003826 |
10 | 20197617 |
11 | 10445850 |
12 | 6920529 |
13 | 425236b |
14 | 297a90d |
15 | 1b8e72c |
hex | 13430f1 |
20197617 has 8 divisors (see below), whose sum is σ = 29378400. Its totient is φ = 12240960.
The previous prime is 20197613. The next prime is 20197621. The reversal of 20197617 is 71679102.
It is an interprime number because it is at equal distance from previous prime (20197613) and next prime (20197621).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20197617 - 22 = 20197613 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 612049 = 20197617 / (2 + 0 + 1 + 9 + 7 + 6 + 1 + 7).
It is not an unprimeable number, because it can be changed into a prime (20197613) 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 in 7 ways as a sum of consecutive naturals, for example, 305992 + ... + 306057.
It is an arithmetic number, because the mean of its divisors is an integer number (3672300).
Almost surely, 220197617 is an apocalyptic number.
It is an amenable number.
20197617 is a deficient number, since it is larger than the sum of its proper divisors (9180783).
20197617 is a wasteful number, since it uses less digits than its factorization.
20197617 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 612063.
The product of its (nonzero) digits is 5292, while the sum is 33.
The square root of 20197617 is about 4494.1758977592. The cubic root of 20197617 is about 272.3328582518.
The spelling of 20197617 in words is "twenty million, one hundred ninety-seven thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •