Search a number
-
+
14509361 = 43337427
BaseRepresentation
bin110111010110…
…010100110001
31000022011002202
4313112110301
512203244421
61234552545
7234220226
oct67262461
930264082
1014509361
118210109
124a38755
133010229
141cd994d
15141910b
hexdd6531

14509361 has 4 divisors (see below), whose sum is σ = 14846832. Its totient is φ = 14171892.

The previous prime is 14509351. The next prime is 14509373. The reversal of 14509361 is 16390541.

14509361 = T198 + T199 + ... + T455.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 16390541 = 21137757.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-14509361 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a nialpdrome in base 16.

It is not an unprimeable number, because it can be changed into a prime (14509351) 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 in 3 ways as a sum of consecutive naturals, for example, 168671 + ... + 168756.

It is an arithmetic number, because the mean of its divisors is an integer number (3711708).

Almost surely, 214509361 is an apocalyptic number.

It is an amenable number.

14509361 is a deficient number, since it is larger than the sum of its proper divisors (337471).

14509361 is an equidigital number, since it uses as much as digits as its factorization.

14509361 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 337470.

The product of its (nonzero) digits is 3240, while the sum is 29.

The square root of 14509361 is about 3809.1155141319. The cubic root of 14509361 is about 243.9024121529.

The spelling of 14509361 in words is "fourteen million, five hundred nine thousand, three hundred sixty-one".

Divisors: 1 43 337427 14509361