Base | Representation |
---|---|
bin | 110111111100… |
… | …101110101101 |
3 | 1000121010212222 |
4 | 313330232231 |
5 | 12223313134 |
6 | 1242205125 |
7 | 235443653 |
oct | 67745655 |
9 | 30533788 |
10 | 14666669 |
11 | 8308316 |
12 | 4ab37a5 |
13 | 3066a04 |
14 | 1d3add3 |
15 | 144aa2e |
hex | dfcbad |
14666669 has 4 divisors (see below), whose sum is σ = 14691996. Its totient is φ = 14641344.
The previous prime is 14666653. The next prime is 14666677. The reversal of 14666669 is 96666641.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4182025 + 10484644 = 2045^2 + 3238^2 .
It is a cyclic number.
It is not a de Polignac number, because 14666669 - 24 = 14666653 is a prime.
It is a super-2 number, since 2×146666692 = 430222359111122, which contains 22 as substring.
It is a Duffinian number.
It is a plaindrome in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14666269) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 11774 + ... + 12959.
It is an arithmetic number, because the mean of its divisors is an integer number (3672999).
Almost surely, 214666669 is an apocalyptic number.
It is an amenable number.
14666669 is a deficient number, since it is larger than the sum of its proper divisors (25327).
14666669 is an equidigital number, since it uses as much as digits as its factorization.
14666669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25326.
The product of its digits is 279936, while the sum is 44.
The square root of 14666669 is about 3829.7087356612. The cubic root of 14666669 is about 244.7806950491.
The spelling of 14666669 in words is "fourteen million, six hundred sixty-six thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •