Base | Representation |
---|---|
bin | 11010000001001111011100 |
3 | 110211112102021 |
4 | 122001033130 |
5 | 3221231303 |
6 | 402105524 |
7 | 111655540 |
oct | 32011734 |
9 | 13745367 |
10 | 6820828 |
11 | 3939653 |
12 | 234b2a4 |
13 | 154a7c1 |
14 | c97a20 |
15 | 8eaebd |
hex | 6813dc |
6820828 has 48 divisors (see below), whose sum is σ = 14321664. Its totient is φ = 2782080.
The previous prime is 6820823. The next prime is 6820841. The reversal of 6820828 is 8280286.
It is a happy number.
It is an Ulam number.
It is a junction number, because it is equal to n+sod(n) for n = 6820793 and 6820802.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6820823) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 93400 + ... + 93472.
It is an arithmetic number, because the mean of its divisors is an integer number (298368).
Almost surely, 26820828 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6820828, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7160832).
6820828 is an abundant number, since it is smaller than the sum of its proper divisors (7500836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6820828 is a wasteful number, since it uses less digits than its factorization.
6820828 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202 (or 200 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 34.
The square root of 6820828 is about 2611.6714954220. The cubic root of 6820828 is about 189.6468787451.
The spelling of 6820828 in words is "six million, eight hundred twenty thousand, eight hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •