Base | Representation |
---|---|
bin | 110101101010… |
… | …001110101000 |
3 | 222110122202012 |
4 | 311222032220 |
5 | 12100112400 |
6 | 1221255052 |
7 | 230364332 |
oct | 65521650 |
9 | 28418665 |
10 | 14066600 |
11 | 7a38499 |
12 | 4864488 |
13 | 2bb6842 |
14 | 1c22452 |
15 | 137cd35 |
hex | d6a3a8 |
14066600 has 48 divisors (see below), whose sum is σ = 33269820. Its totient is φ = 5529600.
The previous prime is 14066597. The next prime is 14066609. The reversal of 14066600 is 666041.
14066600 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 3189796 + 10876804 = 1786^2 + 3298^2 .
It is not an unprimeable number, because it can be changed into a prime (14066609) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11624 + ... + 12776.
Almost surely, 214066600 is an apocalyptic number.
14066600 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 14066600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16634910).
14066600 is an abundant number, since it is smaller than the sum of its proper divisors (19203220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14066600 is a wasteful number, since it uses less digits than its factorization.
14066600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1230 (or 1221 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
The square root of 14066600 is about 3750.5466268265. The cubic root of 14066600 is about 241.3958016882.
The spelling of 14066600 in words is "fourteen million, sixty-six thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •