Base | Representation |
---|---|
bin | 100110101010… |
… | …0110000011001 |
3 | 1102010211100122 |
4 | 1031110300121 |
5 | 20142120410 |
6 | 2002243025 |
7 | 334202342 |
oct | 115246031 |
9 | 42124318 |
10 | 20270105 |
11 | 10495259 |
12 | 6956475 |
13 | 427935b |
14 | 29990c9 |
15 | 1ba5e55 |
hex | 1354c19 |
20270105 has 8 divisors (see below), whose sum is σ = 24381000. Its totient is φ = 16178176.
The previous prime is 20270083. The next prime is 20270119. The reversal of 20270105 is 50107202.
It can be written as a sum of positive squares in 4 ways, for example, as 9406489 + 10863616 = 3067^2 + 3296^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 20270105 - 28 = 20269849 is a prime.
It is a super-2 number, since 2×202701052 = 821754313422050, which contains 22 as substring.
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, 2270 + ... + 6759.
It is an arithmetic number, because the mean of its divisors is an integer number (3047625).
Almost surely, 220270105 is an apocalyptic number.
It is an amenable number.
20270105 is a deficient number, since it is larger than the sum of its proper divisors (4110895).
20270105 is an equidigital number, since it uses as much as digits as its factorization.
20270105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9483.
The product of its (nonzero) digits is 140, while the sum is 17.
The square root of 20270105 is about 4502.2333346907. The cubic root of 20270105 is about 272.6582645437.
Adding to 20270105 its reverse (50107202), we get a palindrome (70377307).
It can be divided in two parts, 202 and 70105, that added together give a palindrome (70307).
The spelling of 20270105 in words is "twenty million, two hundred seventy thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •