Base | Representation |
---|---|
bin | 100110101011… |
… | …0000100110001 |
3 | 1102011002202122 |
4 | 1031112010301 |
5 | 20142304010 |
6 | 2002324025 |
7 | 334224155 |
oct | 115260461 |
9 | 42132678 |
10 | 20275505 |
11 | 10499318 |
12 | 6959615 |
13 | 427b953 |
14 | 299b065 |
15 | 1ba7855 |
hex | 1356131 |
20275505 has 8 divisors (see below), whose sum is σ = 24358632. Its totient is φ = 16201728.
The previous prime is 20275499. The next prime is 20275511. The reversal of 20275505 is 50557202.
It is an interprime number because it is at equal distance from previous prime (20275499) and next prime (20275511).
It can be written as a sum of positive squares in 4 ways, for example, as 9784384 + 10491121 = 3128^2 + 3239^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20275505 is a prime.
It is a super-2 number, since 2×202755052 = 822192206010050, which contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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, 4007 + ... + 7523.
It is an arithmetic number, because the mean of its divisors is an integer number (3044829).
Almost surely, 220275505 is an apocalyptic number.
It is an amenable number.
20275505 is a deficient number, since it is larger than the sum of its proper divisors (4083127).
20275505 is a wasteful number, since it uses less digits than its factorization.
20275505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4675.
The product of its (nonzero) digits is 3500, while the sum is 26.
The square root of 20275505 is about 4502.8329971253. The cubic root of 20275505 is about 272.6824746453.
The spelling of 20275505 in words is "twenty million, two hundred seventy-five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •