Base | Representation |
---|---|
bin | 111111111110… |
… | …001110110010 |
3 | 1011120000002000 |
4 | 333332032302 |
5 | 13243114340 |
6 | 1355234430 |
7 | 262354020 |
oct | 77761662 |
9 | 34500060 |
10 | 16769970 |
11 | 9514588 |
12 | 5748a16 |
13 | 3622179 |
14 | 2327710 |
15 | 1713d30 |
hex | ffe3b2 |
16769970 has 128 divisors (see below), whose sum is σ = 53913600. Its totient is φ = 3623616.
The previous prime is 16769953. The next prime is 16769981. The reversal of 16769970 is 7996761.
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 63 ways as a sum of consecutive naturals, for example, 35677 + ... + 36143.
It is an arithmetic number, because the mean of its divisors is an integer number (421200).
Almost surely, 216769970 is an apocalyptic number.
16769970 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 16769970, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26956800).
16769970 is an abundant number, since it is smaller than the sum of its proper divisors (37143630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16769970 is a wasteful number, since it uses less digits than its factorization.
16769970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 509 (or 503 counting only the distinct ones).
The product of its (nonzero) digits is 142884, while the sum is 45.
The square root of 16769970 is about 4095.1153829898. The cubic root of 16769970 is about 255.9631396310.
The spelling of 16769970 in words is "sixteen million, seven hundred sixty-nine thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •