Base | Representation |
---|---|
bin | 111111101000… |
… | …100000000000 |
3 | 1011101110222100 |
4 | 333220200000 |
5 | 13232242320 |
6 | 1353310400 |
7 | 261533352 |
oct | 77504000 |
9 | 34343870 |
10 | 16680960 |
11 | 946371a |
12 | 5705400 |
13 | 35c07ba |
14 | 23030d2 |
15 | 16e7790 |
hex | fe8800 |
16680960 has 144 divisors (see below), whose sum is σ = 58132620. Its totient is φ = 4423680.
The previous prime is 16680943. The next prime is 16680971. The reversal of 16680960 is 6908661.
It can be written as a sum of positive squares in 2 ways, for example, as 14017536 + 2663424 = 3744^2 + 1632^2 .
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a nialpdrome in base 16.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 92070 + ... + 92250.
Almost surely, 216680960 is an apocalyptic number.
16680960 is a gapful number since it is divisible by the number (10) 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 16680960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29066310).
16680960 is an abundant number, since it is smaller than the sum of its proper divisors (41451660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16680960 is a wasteful number, since it uses less digits than its factorization.
16680960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214 (or 191 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The square root of 16680960 is about 4084.2330981471. The cubic root of 16680960 is about 255.5094773746.
The spelling of 16680960 in words is "sixteen million, six hundred eighty thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •