Base | Representation |
---|---|
bin | 100111110111100… |
… | …110100000101000 |
3 | 1201121121222120120 |
4 | 213313212200220 |
5 | 2332213341310 |
6 | 150212323240 |
7 | 22401306051 |
oct | 4767464050 |
9 | 1647558516 |
10 | 668887080 |
11 | 313629844 |
12 | 168013520 |
13 | a8767994 |
14 | 64b99728 |
15 | 3dac8b70 |
hex | 27de6828 |
668887080 has 128 divisors (see below), whose sum is σ = 2062195200. Its totient is φ = 173484032.
The previous prime is 668887069. The next prime is 668887103. The reversal of 668887080 is 80788866.
668887080 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1313866 + ... + 1314374.
It is an arithmetic number, because the mean of its divisors is an integer number (16110900).
Almost surely, 2668887080 is an apocalyptic number.
668887080 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 668887080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1031097600).
668887080 is an abundant number, since it is smaller than the sum of its proper divisors (1393308120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
668887080 is a wasteful number, since it uses less digits than its factorization.
668887080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 803 (or 799 counting only the distinct ones).
The product of its (nonzero) digits is 1032192, while the sum is 51.
The square root of 668887080 is about 25862.8513509242. The cubic root of 668887080 is about 874.5492448407.
The spelling of 668887080 in words is "six hundred sixty-eight million, eight hundred eighty-seven thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •