Base | Representation |
---|---|
bin | 110111010010… |
… | …011001000001 |
3 | 1000021100000000 |
4 | 313102121001 |
5 | 12202240444 |
6 | 1234350213 |
7 | 234122241 |
oct | 67223101 |
9 | 30240000 |
10 | 14493249 |
11 | 81a9aa1 |
12 | 4a2b369 |
13 | 3005ab4 |
14 | 1cd3b21 |
15 | 1414469 |
hex | dd2641 |
14493249 has 27 divisors (see below), whose sum is σ = 22211137. Its totient is φ = 9456588.
The previous prime is 14493247. The next prime is 14493251. The reversal of 14493249 is 94239441.
The square root of 14493249 is 3807.
It is a perfect power (a square), and thus also a powerful number.
It is an interprime number because it is at equal distance from previous prime (14493247) and next prime (14493251).
It is a tau number, because it is divible by the number of its divisors (27).
It is not a de Polignac number, because 14493249 - 21 = 14493247 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14493247) 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 in 26 ways as a sum of consecutive naturals, for example, 308344 + ... + 308390.
Almost surely, 214493249 is an apocalyptic number.
14493249 is the 3807-th square number.
14493249 is the 1904-th centered octagonal number.
It is an amenable number.
14493249 is a deficient number, since it is larger than the sum of its proper divisors (7717888).
14493249 is an frugal number, since it uses more digits than its factorization.
14493249 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118 (or 50 counting only the distinct ones).
The product of its digits is 31104, while the sum is 36.
The cubic root of 14493249 is about 243.8120977881.
Multiplying 14493249 by its sum of digits (36), we get a square (521756964 = 228422).
The spelling of 14493249 in words is "fourteen million, four hundred ninety-three thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •