Base | Representation |
---|---|
bin | 110110001001… |
… | …101110011001 |
3 | 222201012201022 |
4 | 312021232121 |
5 | 12113224414 |
6 | 1224132225 |
7 | 231442421 |
oct | 66115631 |
9 | 28635638 |
10 | 14195609 |
11 | 801640a |
12 | 4907075 |
13 | 2c3048c |
14 | 1c57481 |
15 | 13a618e |
hex | d89b99 |
14195609 has 4 divisors (see below), whose sum is σ = 14204340. Its totient is φ = 14186880.
The previous prime is 14195593. The next prime is 14195611. The reversal of 14195609 is 90659141.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 90659141 = 983 ⋅92227.
It can be written as a sum of positive squares in 2 ways, for example, as 11055625 + 3139984 = 3325^2 + 1772^2 .
It is a cyclic number.
It is not a de Polignac number, because 14195609 - 24 = 14195593 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14195009) 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, 1124 + ... + 5445.
It is an arithmetic number, because the mean of its divisors is an integer number (3551085).
Almost surely, 214195609 is an apocalyptic number.
It is an amenable number.
14195609 is a deficient number, since it is larger than the sum of its proper divisors (8731).
14195609 is an equidigital number, since it uses as much as digits as its factorization.
14195609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8730.
The product of its (nonzero) digits is 9720, while the sum is 35.
The square root of 14195609 is about 3767.7060660301. The cubic root of 14195609 is about 242.1315281184.
The spelling of 14195609 in words is "fourteen million, one hundred ninety-five thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •