Base | Representation |
---|---|
bin | 100000011101… |
… | …1011110011100 |
3 | 1012000202012001 |
4 | 1000323132130 |
5 | 13324131303 |
6 | 1404452044 |
7 | 264450256 |
oct | 100733634 |
9 | 35022161 |
10 | 17020828 |
11 | 9676000 |
12 | 584a024 |
13 | 36ac3c6 |
14 | 2390cd6 |
15 | 176331d |
hex | 103b79c |
17020828 has 48 divisors (see below), whose sum is σ = 34433280. Its totient is φ = 7347120.
The previous prime is 17020813. The next prime is 17020831. The reversal of 17020828 is 82802071.
It is a Smith number, since the sum of its digits (28) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 17020796 and 17020805.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 122383 + ... + 122521.
It is an arithmetic number, because the mean of its divisors is an integer number (717360).
Almost surely, 217020828 is an apocalyptic number.
It is an amenable number.
17020828 is an abundant number, since it is smaller than the sum of its proper divisors (17412452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
17020828 is a wasteful number, since it uses less digits than its factorization.
17020828 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199 (or 175 counting only the distinct ones).
The product of its (nonzero) digits is 1792, while the sum is 28.
The square root of 17020828 is about 4125.6306184631. The cubic root of 17020828 is about 257.2331253336.
Adding to 17020828 its reverse (82802071), we get a palindrome (99822899).
It can be divided in two parts, 170208 and 28, that added together give a triangular number (170236 = T583).
The spelling of 17020828 in words is "seventeen million, twenty thousand, eight hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •