Base | Representation |
---|---|
bin | 100110010110… |
… | …1100100011101 |
3 | 1101211200011220 |
4 | 1030231210131 |
5 | 20122001342 |
6 | 1555003553 |
7 | 332633364 |
oct | 114554435 |
9 | 41750156 |
10 | 20109597 |
11 | 10395702 |
12 | 68995b9 |
13 | 4221291 |
14 | 29567db |
15 | 1b735ec |
hex | 132d91d |
20109597 has 4 divisors (see below), whose sum is σ = 26812800. Its totient is φ = 13406396.
The previous prime is 20109577. The next prime is 20109601. The reversal of 20109597 is 79590102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20109597 - 216 = 20044061 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20109517) 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 3 ways as a sum of consecutive naturals, for example, 3351597 + ... + 3351602.
It is an arithmetic number, because the mean of its divisors is an integer number (6703200).
Almost surely, 220109597 is an apocalyptic number.
It is an amenable number.
20109597 is a deficient number, since it is larger than the sum of its proper divisors (6703203).
20109597 is an equidigital number, since it uses as much as digits as its factorization.
20109597 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6703202.
The product of its (nonzero) digits is 5670, while the sum is 33.
The square root of 20109597 is about 4484.3725313582. The cubic root of 20109597 is about 271.9366787794.
Adding to 20109597 its reverse (79590102), we get a palindrome (99699699).
It can be divided in two parts, 20109 and 597, that added together give a triangular number (20706 = T203).
The spelling of 20109597 in words is "twenty million, one hundred nine thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •