Base | Representation |
---|---|
bin | 10100011110000100000 |
3 | 1021002002200 |
4 | 2203300200 |
5 | 132431002 |
6 | 22213200 |
7 | 5462355 |
oct | 2436040 |
9 | 1232080 |
10 | 670752 |
11 | 418a45 |
12 | 284200 |
13 | 1a63c4 |
14 | 13662c |
15 | d3b1c |
hex | a3c20 |
670752 has 72 divisors (see below), whose sum is σ = 2034396. Its totient is φ = 208896.
The previous prime is 670739. The next prime is 670763. The reversal of 670752 is 257076.
It can be written as a sum of positive squares in 2 ways, for example, as 646416 + 24336 = 804^2 + 156^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 670752.
It is an unprimeable number.
670752 is an untouchable number, because it is not equal to the sum of proper divisors of any number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4828 + ... + 4964.
2670752 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 670752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1017198).
670752 is an abundant number, since it is smaller than the sum of its proper divisors (1363644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
670752 is a wasteful number, since it uses less digits than its factorization.
670752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170 (or 159 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 27.
The square root of 670752 is about 818.9945054761. The cubic root of 670752 is about 87.5361265788.
The spelling of 670752 in words is "six hundred seventy thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •