Base | Representation |
---|---|
bin | 110111010001… |
… | …100000101100 |
3 | 1000021011001111 |
4 | 313101200230 |
5 | 12202132034 |
6 | 1234321404 |
7 | 234105601 |
oct | 67214054 |
9 | 30234044 |
10 | 14489644 |
11 | 81a7314 |
12 | 4a29264 |
13 | 3004270 |
14 | 1cd26a8 |
15 | 1413364 |
hex | dd182c |
14489644 has 48 divisors (see below), whose sum is σ = 29762208. Its totient is φ = 6110208.
The previous prime is 14489641. The next prime is 14489659. The reversal of 14489644 is 44698441.
14489644 = T1 + T2 + ... + T442.
14489644 is a nontrivial binomial coefficient, being equal to C(444, 3).
Its product of digits (110592) is a multiple of the sum of its prime divisors (512).
It is a junction number, because it is equal to n+sod(n) for n = 14489597 and 14489606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14489641) by changing a digit.
It is the 442-nd tetrahedral number.
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 15 ways as a sum of consecutive naturals, for example, 32487 + ... + 32929.
It is an arithmetic number, because the mean of its divisors is an integer number (620046).
Almost surely, 214489644 is an apocalyptic number.
It is an amenable number.
14489644 is an abundant number, since it is smaller than the sum of its proper divisors (15272564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14489644 is a wasteful number, since it uses less digits than its factorization.
14489644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 514 (or 512 counting only the distinct ones).
The product of its digits is 110592, while the sum is 40.
The square root of 14489644 is about 3806.5265006302. The cubic root of 14489644 is about 243.7918811227.
The spelling of 14489644 in words is "fourteen million, four hundred eighty-nine thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •