Base | Representation |
---|---|
bin | 100110101010… |
… | …0111000110101 |
3 | 1102010212002122 |
4 | 1031110320311 |
5 | 20142130040 |
6 | 2002245325 |
7 | 334204043 |
oct | 115247065 |
9 | 42125078 |
10 | 20270645 |
11 | 104956aa |
12 | 6956845 |
13 | 4279685 |
14 | 2999393 |
15 | 1ba61b5 |
hex | 1354e35 |
20270645 has 8 divisors (see below), whose sum is σ = 24784056. Its totient is φ = 15910336.
The previous prime is 20270641. The next prime is 20270671. The reversal of 20270645 is 54607202.
20270645 = T2845 + T2846 + ... + T2849.
It can be written as a sum of positive squares in 4 ways, for example, as 972196 + 19298449 = 986^2 + 4393^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 20270645 - 22 = 20270641 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20270641) 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 7 ways as a sum of consecutive naturals, for example, 37982 + ... + 38511.
It is an arithmetic number, because the mean of its divisors is an integer number (3098007).
Almost surely, 220270645 is an apocalyptic number.
It is an amenable number.
20270645 is a deficient number, since it is larger than the sum of its proper divisors (4513411).
20270645 is an equidigital number, since it uses as much as digits as its factorization.
20270645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76551.
The product of its (nonzero) digits is 3360, while the sum is 26.
The square root of 20270645 is about 4502.2933045283. The cubic root of 20270645 is about 272.6606857473.
Adding to 20270645 its reverse (54607202), we get a palindrome (74877847).
The spelling of 20270645 in words is "twenty million, two hundred seventy thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •