Base | Representation |
---|---|
bin | 110111001001… |
… | …010101010101 |
3 | 1000012110002221 |
4 | 313021111111 |
5 | 12200044044 |
6 | 1233502341 |
7 | 233606131 |
oct | 67112525 |
9 | 30173087 |
10 | 14456149 |
11 | 8184134 |
12 | 4a119b1 |
13 | 2cc1c46 |
14 | 1cc43c1 |
15 | 1408484 |
hex | dc9555 |
14456149 has 4 divisors (see below), whose sum is σ = 14808780. Its totient is φ = 14103520.
The previous prime is 14456147. The next prime is 14456161. The reversal of 14456149 is 94165441.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 94165441 = 1013 ⋅92957.
It can be written as a sum of positive squares in 2 ways, for example, as 7193124 + 7263025 = 2682^2 + 2695^2 .
It is a cyclic number.
It is not a de Polignac number, because 14456149 - 21 = 14456147 is a prime.
It is a Duffinian number.
It is a nialpdrome in base 16.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14456147) 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, 176254 + ... + 176335.
It is an arithmetic number, because the mean of its divisors is an integer number (3702195).
Almost surely, 214456149 is an apocalyptic number.
It is an amenable number.
14456149 is a deficient number, since it is larger than the sum of its proper divisors (352631).
14456149 is an equidigital number, since it uses as much as digits as its factorization.
14456149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352630.
The product of its digits is 17280, while the sum is 34.
The square root of 14456149 is about 3802.1242746654. The cubic root of 14456149 is about 243.6038822706.
The spelling of 14456149 in words is "fourteen million, four hundred fifty-six thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •