Base | Representation |
---|---|
bin | 110111111100… |
… | …100111010111 |
3 | 1000121010020120 |
4 | 313330213113 |
5 | 12223304244 |
6 | 1242203023 |
7 | 235442412 |
oct | 67744727 |
9 | 30533216 |
10 | 14666199 |
11 | 8307a29 |
12 | 4ab3473 |
13 | 3066732 |
14 | 1d3ab79 |
15 | 144a819 |
hex | dfc9d7 |
14666199 has 12 divisors (see below), whose sum is σ = 20255976. Its totient is φ = 9438688.
The previous prime is 14666191. The next prime is 14666207. The reversal of 14666199 is 99166641.
It is an interprime number because it is at equal distance from previous prime (14666191) and next prime (14666207).
It is not a de Polignac number, because 14666199 - 23 = 14666191 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 14666199.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14666191) 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 11 ways as a sum of consecutive naturals, for example, 384 + ... + 5429.
It is an arithmetic number, because the mean of its divisors is an integer number (1687998).
Almost surely, 214666199 is an apocalyptic number.
14666199 is a deficient number, since it is larger than the sum of its proper divisors (5589777).
14666199 is an equidigital number, since it uses as much as digits as its factorization.
14666199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5874 (or 5845 counting only the distinct ones).
The product of its digits is 69984, while the sum is 42.
The square root of 14666199 is about 3829.6473728008. The cubic root of 14666199 is about 244.7780803187.
The spelling of 14666199 in words is "fourteen million, six hundred sixty-six thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •