Base | Representation |
---|---|
bin | 111000001110… |
… | …101101000001 |
3 | 1000201212212122 |
4 | 320032231001 |
5 | 12233142124 |
6 | 1243534025 |
7 | 236201414 |
oct | 70165501 |
9 | 30655778 |
10 | 14740289 |
11 | 8358663 |
12 | 4b2a315 |
13 | 3091385 |
14 | 1d59b7b |
15 | 146275e |
hex | e0eb41 |
14740289 has 2 divisors, whose sum is σ = 14740290. Its totient is φ = 14740288.
The previous prime is 14740261. The next prime is 14740291. The reversal of 14740289 is 98204741.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14691889 + 48400 = 3833^2 + 220^2 .
It is an emirp because it is prime and its reverse (98204741) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14740289 - 212 = 14736193 is a prime.
It is a super-2 number, since 2×147402892 = 434552239607042, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 14740291, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (14740189) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7370144 + 7370145.
It is an arithmetic number, because the mean of its divisors is an integer number (7370145).
Almost surely, 214740289 is an apocalyptic number.
It is an amenable number.
14740289 is a deficient number, since it is larger than the sum of its proper divisors (1).
14740289 is an equidigital number, since it uses as much as digits as its factorization.
14740289 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 35.
The square root of 14740289 is about 3839.3084012619. The cubic root of 14740289 is about 245.1895742245.
The spelling of 14740289 in words is "fourteen million, seven hundred forty thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •