Base | Representation |
---|---|
bin | 111111101000… |
… | …010110001010 |
3 | 1011101110010000 |
4 | 333220112022 |
5 | 13232232310 |
6 | 1353303430 |
7 | 261531462 |
oct | 77502612 |
9 | 34343100 |
10 | 16680330 |
11 | 94631a7 |
12 | 5704b76 |
13 | 35c0424 |
14 | 2302ba2 |
15 | 16e74c0 |
hex | fe858a |
16680330 has 40 divisors (see below), whose sum is σ = 44853732. Its totient is φ = 4447872.
The previous prime is 16680311. The next prime is 16680331. The reversal of 16680330 is 3308661.
It can be written as a sum of positive squares in 2 ways, for example, as 15752961 + 927369 = 3969^2 + 963^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 16680294 and 16680303.
It is not an unprimeable number, because it can be changed into a prime (16680331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 9487 + ... + 11106.
Almost surely, 216680330 is an apocalyptic number.
16680330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16680330 is an abundant number, since it is smaller than the sum of its proper divisors (28173402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16680330 is a wasteful number, since it uses less digits than its factorization.
16680330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20612 (or 20603 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The square root of 16680330 is about 4084.1559715564. The cubic root of 16680330 is about 255.5062606733.
Adding to 16680330 its reverse (3308661), we get a palindrome (19988991).
The spelling of 16680330 in words is "sixteen million, six hundred eighty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •