Base | Representation |
---|---|
bin | 11010001110110… |
… | …11011001010001 |
3 | 120100001202020222 |
4 | 31013123121101 |
5 | 422313113100 |
6 | 33500242425 |
7 | 5311255115 |
oct | 1507333121 |
9 | 510052228 |
10 | 220051025 |
11 | 103238657 |
12 | 61840415 |
13 | 36787a0c |
14 | 21321745 |
15 | 144ba485 |
hex | d1db651 |
220051025 has 24 divisors (see below), whose sum is σ = 281716344. Its totient is φ = 170380800.
The previous prime is 220051021. The next prime is 220051031. The reversal of 220051025 is 520150022.
It can be written as a sum of positive squares in 12 ways, for example, as 37368769 + 182682256 = 6113^2 + 13516^2 .
It is not a de Polignac number, because 220051025 - 22 = 220051021 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 220050994 and 220051012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220051021) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 215015 + ... + 216035.
It is an arithmetic number, because the mean of its divisors is an integer number (11738181).
Almost surely, 2220051025 is an apocalyptic number.
220051025 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
220051025 is a deficient number, since it is larger than the sum of its proper divisors (61665319).
220051025 is a wasteful number, since it uses less digits than its factorization.
220051025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1301 (or 1296 counting only the distinct ones).
The product of its (nonzero) digits is 200, while the sum is 17.
The square root of 220051025 is about 14834.1169268683. The cubic root of 220051025 is about 603.7277410217.
The spelling of 220051025 in words is "two hundred twenty million, fifty-one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •