Base | Representation |
---|---|
bin | 101000010100100… |
… | …010000011011000 |
3 | 1202010220021202111 |
4 | 220110202003120 |
5 | 2341134033000 |
6 | 151043042104 |
7 | 22522623442 |
oct | 5024420330 |
9 | 1663807674 |
10 | 676471000 |
11 | 317939747 |
12 | 16a670334 |
13 | aa1c18ca |
14 | 65bb1492 |
15 | 3e5c5cba |
hex | 285220d8 |
676471000 has 128 divisors (see below), whose sum is σ = 1664582400. Its totient is φ = 257011200.
The previous prime is 676470923. The next prime is 676471007. The reversal of 676471000 is 174676.
It is a super-3 number, since 3×6764710003 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (676471007) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1738806 + ... + 1739194.
It is an arithmetic number, because the mean of its divisors is an integer number (13004550).
Almost surely, 2676471000 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 676471000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (832291200).
676471000 is an abundant number, since it is smaller than the sum of its proper divisors (988111400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
676471000 is a wasteful number, since it uses less digits than its factorization.
676471000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 494 (or 480 counting only the distinct ones).
The product of its (nonzero) digits is 7056, while the sum is 31.
The square root of 676471000 is about 26009.0561151304. The cubic root of 676471000 is about 877.8420784078.
The spelling of 676471000 in words is "six hundred seventy-six million, four hundred seventy-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •