Base | Representation |
---|---|
bin | 110101101001… |
… | …111011101111 |
3 | 222110121002102 |
4 | 311221323233 |
5 | 12100043031 |
6 | 1221245315 |
7 | 230360654 |
oct | 65517357 |
9 | 28417072 |
10 | 14065391 |
11 | 7a3759a |
12 | 486383b |
13 | 2bb6122 |
14 | 1c21c2b |
15 | 137c7cb |
hex | d69eef |
14065391 has 2 divisors, whose sum is σ = 14065392. Its totient is φ = 14065390.
The previous prime is 14065357. The next prime is 14065393. The reversal of 14065391 is 19356041.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14065391 is a prime.
Together with 14065393, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14065393) 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 as a sum of consecutive naturals, namely, 7032695 + 7032696.
It is an arithmetic number, because the mean of its divisors is an integer number (7032696).
Almost surely, 214065391 is an apocalyptic number.
14065391 is a deficient number, since it is larger than the sum of its proper divisors (1).
14065391 is an equidigital number, since it uses as much as digits as its factorization.
14065391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 29.
The square root of 14065391 is about 3750.3854468574. The cubic root of 14065391 is about 241.3888856392.
The spelling of 14065391 in words is "fourteen million, sixty-five thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •