Base | Representation |
---|---|
bin | 100111001001… |
… | …1110101011101 |
3 | 1102121221202222 |
4 | 1032103311131 |
5 | 20223402402 |
6 | 2011555125 |
7 | 336326534 |
oct | 116236535 |
9 | 42557688 |
10 | 20528477 |
11 | 10651392 |
12 | 6a5baa5 |
13 | 4339b38 |
14 | 2a2531b |
15 | 1c077a2 |
hex | 1393d5d |
20528477 has 4 divisors (see below), whose sum is σ = 20642076. Its totient is φ = 20414880.
The previous prime is 20528471. The next prime is 20528483. The reversal of 20528477 is 77482502.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (20528471) and next prime (20528483).
It can be written as a sum of positive squares in 2 ways, for example, as 1466521 + 19061956 = 1211^2 + 4366^2 .
It is a cyclic number.
It is not a de Polignac number, because 20528477 - 210 = 20527453 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 (20528471) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 56528 + ... + 56889.
It is an arithmetic number, because the mean of its divisors is an integer number (5160519).
Almost surely, 220528477 is an apocalyptic number.
It is an amenable number.
20528477 is a deficient number, since it is larger than the sum of its proper divisors (113599).
20528477 is a wasteful number, since it uses less digits than its factorization.
20528477 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113598.
The product of its (nonzero) digits is 31360, while the sum is 35.
The square root of 20528477 is about 4530.8362362813. The cubic root of 20528477 is about 273.8118524707.
It can be divided in two parts, 205 and 28477, that added together give a palindrome (28682).
The spelling of 20528477 in words is "twenty million, five hundred twenty-eight thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.052 sec. • engine limits •