Base | Representation |
---|---|
bin | 100110110001… |
… | …1100001111001 |
3 | 1102020220100211 |
4 | 1031203201321 |
5 | 20201034432 |
6 | 2003431121 |
7 | 334543636 |
oct | 115434171 |
9 | 42226324 |
10 | 20330617 |
11 | 1052676a |
12 | 69854a1 |
13 | 429aa68 |
14 | 29b318d |
15 | 1bb8d47 |
hex | 1363879 |
20330617 has 4 divisors (see below), whose sum is σ = 20339956. Its totient is φ = 20321280.
The previous prime is 20330591. The next prime is 20330647. The reversal of 20330617 is 71603302.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 7160976 + 13169641 = 2676^2 + 3629^2 .
It is a cyclic number.
It is not a de Polignac number, because 20330617 - 211 = 20328569 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20330647) 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, 517 + ... + 6397.
It is an arithmetic number, because the mean of its divisors is an integer number (5084989).
Almost surely, 220330617 is an apocalyptic number.
It is an amenable number.
20330617 is a deficient number, since it is larger than the sum of its proper divisors (9339).
20330617 is an equidigital number, since it uses as much as digits as its factorization.
20330617 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9338.
The product of its (nonzero) digits is 756, while the sum is 22.
The square root of 20330617 is about 4508.9485470562. The cubic root of 20330617 is about 272.9293156955.
Adding to 20330617 its reverse (71603302), we get a palindrome (91933919).
The spelling of 20330617 in words is "twenty million, three hundred thirty thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •