Base | Representation |
---|---|
bin | 111111111101… |
… | …000011010100 |
3 | 1011112202110010 |
4 | 333331003110 |
5 | 13242441030 |
6 | 1355200220 |
7 | 262333650 |
oct | 77750324 |
9 | 34482403 |
10 | 16765140 |
11 | 9510997 |
12 | 5746070 |
13 | 361cc02 |
14 | 2325a60 |
15 | 17126b0 |
hex | ffd0d4 |
16765140 has 96 divisors (see below), whose sum is σ = 54190080. Its totient is φ = 3793536.
The previous prime is 16765139. The next prime is 16765157. The reversal of 16765140 is 4156761.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 16765098 and 16765107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 75069 + ... + 75291.
It is an arithmetic number, because the mean of its divisors is an integer number (564480).
Almost surely, 216765140 is an apocalyptic number.
16765140 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 16765140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27095040).
16765140 is an abundant number, since it is smaller than the sum of its proper divisors (37424940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16765140 is a wasteful number, since it uses less digits than its factorization.
16765140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 421 (or 419 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 30.
The square root of 16765140 is about 4094.5256135479. The cubic root of 16765140 is about 255.9385635450.
The spelling of 16765140 in words is "sixteen million, seven hundred sixty-five thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •