Base | Representation |
---|---|
bin | 110110000010… |
… | …101010011100 |
3 | 222122202001000 |
4 | 312002222130 |
5 | 12111313214 |
6 | 1223350300 |
7 | 231262200 |
oct | 66025234 |
9 | 28582030 |
10 | 14166684 |
11 | 7aa6704 |
12 | 48b2390 |
13 | 2c2026c |
14 | 1c4ab00 |
15 | 139c809 |
hex | d82a9c |
14166684 has 72 divisors (see below), whose sum is σ = 42740880. Its totient is φ = 4046112.
The previous prime is 14166679. The next prime is 14166707. The reversal of 14166684 is 48666141.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3954 + ... + 6630.
Almost surely, 214166684 is an apocalyptic number.
14166684 is a gapful number since it is divisible by the number (14) 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 14166684, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21370440).
14166684 is an abundant number, since it is smaller than the sum of its proper divisors (28574196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14166684 is a wasteful number, since it uses less digits than its factorization.
14166684 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2704 (or 2689 counting only the distinct ones).
The product of its digits is 27648, while the sum is 36.
The square root of 14166684 is about 3763.8655661434. The cubic root of 14166684 is about 241.9669604053.
It can be divided in two parts, 1416 and 6684, that added together give a square (8100 = 902).
The spelling of 14166684 in words is "fourteen million, one hundred sixty-six thousand, six hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •