Base | Representation |
---|---|
bin | 100111110100100… |
… | …010111111000000 |
3 | 1201120010021222122 |
4 | 213310202333000 |
5 | 2332012224313 |
6 | 150143223412 |
7 | 22361432126 |
oct | 4764427700 |
9 | 1646107878 |
10 | 668086208 |
11 | 313132069 |
12 | 1678a7b68 |
13 | a85472aa |
14 | 64a2b916 |
15 | 3d9bb708 |
hex | 27d22fc0 |
668086208 has 112 divisors (see below), whose sum is σ = 1482547200. Its totient is φ = 297354240.
The previous prime is 668086207. The next prime is 668086219. The reversal of 668086208 is 802680866.
668086208 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×6680862083 (a number of 27 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (668086207) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1394513 + ... + 1394991.
Almost surely, 2668086208 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 668086208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (741273600).
668086208 is an abundant number, since it is smaller than the sum of its proper divisors (814460992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
668086208 is a wasteful number, since it uses less digits than its factorization.
668086208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 578 (or 568 counting only the distinct ones).
The product of its (nonzero) digits is 221184, while the sum is 44.
The square root of 668086208 is about 25847.3636566672. The cubic root of 668086208 is about 874.2000669575.
The spelling of 668086208 in words is "six hundred sixty-eight million, eighty-six thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •