Base | Representation |
---|---|
bin | 111111101001… |
… | …111110001110 |
3 | 1011101210020200 |
4 | 333221332032 |
5 | 13232440430 |
6 | 1353354330 |
7 | 261560055 |
oct | 77517616 |
9 | 34353220 |
10 | 16686990 |
11 | 9468201 |
12 | 57089a6 |
13 | 35c3478 |
14 | 230539c |
15 | 16e9460 |
hex | fe9f8e |
16686990 has 48 divisors (see below), whose sum is σ = 44793216. Its totient is φ = 4305600.
The previous prime is 16686961. The next prime is 16687003. The reversal of 16686990 is 9968661.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 201 + ... + 5780.
It is an arithmetic number, because the mean of its divisors is an integer number (933192).
Almost surely, 216686990 is an apocalyptic number.
16686990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 16686990, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22396608).
16686990 is an abundant number, since it is smaller than the sum of its proper divisors (28106226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16686990 is a wasteful number, since it uses less digits than its factorization.
16686990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6025 (or 6022 counting only the distinct ones).
The product of its (nonzero) digits is 139968, while the sum is 45.
The square root of 16686990 is about 4084.9712361288. The cubic root of 16686990 is about 255.5402617046.
The spelling of 16686990 in words is "sixteen million, six hundred eighty-six thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •