Base | Representation |
---|---|
bin | 100110010000… |
… | …0001111110001 |
3 | 1101201220022201 |
4 | 1030200033301 |
5 | 20113230100 |
6 | 1553503201 |
7 | 332315314 |
oct | 114401761 |
9 | 41656281 |
10 | 20055025 |
11 | 10358701 |
12 | 6871b01 |
13 | 42024a3 |
14 | 294097b |
15 | 1b6236a |
hex | 13203f1 |
20055025 has 12 divisors (see below), whose sum is σ = 25017372. Its totient is φ = 15947840.
The previous prime is 20055017. The next prime is 20055083. The reversal of 20055025 is 52055002.
It can be written as a sum of positive squares in 6 ways, for example, as 20449 + 20034576 = 143^2 + 4476^2 .
It is not a de Polignac number, because 20055025 - 23 = 20055017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20054993 and 20055011.
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 11 ways as a sum of consecutive naturals, for example, 2007 + ... + 6643.
It is an arithmetic number, because the mean of its divisors is an integer number (2084781).
Almost surely, 220055025 is an apocalyptic number.
20055025 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
20055025 is a deficient number, since it is larger than the sum of its proper divisors (4962347).
20055025 is a wasteful number, since it uses less digits than its factorization.
20055025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4820 (or 4815 counting only the distinct ones).
The product of its (nonzero) digits is 500, while the sum is 19.
The square root of 20055025 is about 4478.2837114234. The cubic root of 20055025 is about 271.6904684295.
It can be divided in two parts, 200 and 55025, that added together give a square (55225 = 2352).
The spelling of 20055025 in words is "twenty million, fifty-five thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •