Base | Representation |
---|---|
bin | 101000110001100… |
… | …001010001110000 |
3 | 1202200012100121221 |
4 | 220301201101300 |
5 | 2400110220000 |
6 | 151513554424 |
7 | 22644333115 |
oct | 5061412160 |
9 | 1680170557 |
10 | 684070000 |
11 | 321159a09 |
12 | 171115a14 |
13 | ab952663 |
14 | 66bcc90c |
15 | 400c761a |
hex | 28c61470 |
684070000 has 100 divisors (see below), whose sum is σ = 1682567656. Its totient is φ = 269280000.
The previous prime is 684069989. The next prime is 684070001. The reversal of 684070000 is 70486.
It is a tau number, because it is divible by the number of its divisors (100).
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (684070001) 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 19 ways as a sum of consecutive naturals, for example, 669490 + ... + 670510.
Almost surely, 2684070000 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 684070000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (841283828).
684070000 is an abundant number, since it is smaller than the sum of its proper divisors (998497656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
684070000 is a wasteful number, since it uses less digits than its factorization.
684070000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1116 (or 1095 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 25.
The square root of 684070000 is about 26154.7318854543. The cubic root of 684070000 is about 881.1168670334.
The spelling of 684070000 in words is "six hundred eighty-four million, seventy thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •