Base | Representation |
---|---|
bin | 110110101111… |
… | …001100000011 |
3 | 1000000000012122 |
4 | 312233030003 |
5 | 12133132214 |
6 | 1231314455 |
7 | 232651664 |
oct | 66571403 |
9 | 30000178 |
10 | 14349059 |
11 | 811072a |
12 | 497ba2b |
13 | 2c8528a |
14 | 1c9736b |
15 | 13d688e |
hex | daf303 |
14349059 has 2 divisors, whose sum is σ = 14349060. Its totient is φ = 14349058.
The previous prime is 14349031. The next prime is 14349103. The reversal of 14349059 is 95094341.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14349059 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (14349259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7174529 + 7174530.
It is an arithmetic number, because the mean of its divisors is an integer number (7174530).
Almost surely, 214349059 is an apocalyptic number.
14349059 is a deficient number, since it is larger than the sum of its proper divisors (1).
14349059 is an equidigital number, since it uses as much as digits as its factorization.
14349059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 35.
The square root of 14349059 is about 3788.0151794838. The cubic root of 14349059 is about 243.0008580414. Note that the first 3 decimals are identical.
The spelling of 14349059 in words is "fourteen million, three hundred forty-nine thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •