Base | Representation |
---|---|
bin | 101000110100001… |
… | …100011011000100 |
3 | 1202201111222020100 |
4 | 220310030123010 |
5 | 2400300133022 |
6 | 151541004100 |
7 | 22653312642 |
oct | 5064143304 |
9 | 1681458210 |
10 | 684771012 |
11 | 321598662 |
12 | 1713b3630 |
13 | abb39763 |
14 | 66d32192 |
15 | 401b51ac |
hex | 28d0c6c4 |
684771012 has 72 divisors (see below), whose sum is σ = 1811077632. Its totient is φ = 217929600.
The previous prime is 684770993. The next prime is 684771013. The reversal of 684771012 is 210177486.
It is a super-2 number, since 2×6847710122 = 937822677751008288, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (684771013) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 64437 + ... + 74307.
It is an arithmetic number, because the mean of its divisors is an integer number (25153856).
Almost surely, 2684771012 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 684771012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (905538816).
684771012 is an abundant number, since it is smaller than the sum of its proper divisors (1126306620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
684771012 is a wasteful number, since it uses less digits than its factorization.
684771012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9969 (or 9964 counting only the distinct ones).
The product of its (nonzero) digits is 18816, while the sum is 36.
The square root of 684771012 is about 26168.1297000760. The cubic root of 684771012 is about 881.4177439548.
The spelling of 684771012 in words is "six hundred eighty-four million, seven hundred seventy-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •