Base | Representation |
---|---|
bin | 11001100100111100100000 |
3 | 110121122102200 |
4 | 121210330200 |
5 | 3204024203 |
6 | 355413200 |
7 | 110663616 |
oct | 31447440 |
9 | 13548380 |
10 | 6704928 |
11 | 386a56a |
12 | 22b4200 |
13 | 1509b19 |
14 | c676b6 |
15 | 8c69a3 |
hex | 664f20 |
6704928 has 72 divisors (see below), whose sum is σ = 19708416. Its totient is φ = 2160000.
The previous prime is 6704927. The next prime is 6704969. The reversal of 6704928 is 8294076.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 6704892 and 6704901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6704921) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8553 + ... + 9303.
It is an arithmetic number, because the mean of its divisors is an integer number (273728).
Almost surely, 26704928 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 6704928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9854208).
6704928 is an abundant number, since it is smaller than the sum of its proper divisors (13003488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6704928 is a wasteful number, since it uses less digits than its factorization.
6704928 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 798 (or 787 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 6704928 is about 2589.3875723808. The cubic root of 6704928 is about 188.5665720906.
The spelling of 6704928 in words is "six million, seven hundred four thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •