Base | Representation |
---|---|
bin | 110111010110… |
… | …011011001000 |
3 | 1000022011122211 |
4 | 313112123020 |
5 | 12203303033 |
6 | 1234554504 |
7 | 234221350 |
oct | 67263310 |
9 | 30264584 |
10 | 14509768 |
11 | 8210449 |
12 | 4a38a34 |
13 | 3010480 |
14 | 1cd9b60 |
15 | 14192cd |
hex | dd66c8 |
14509768 has 64 divisors (see below), whose sum is σ = 35280000. Its totient is φ = 5432832.
The previous prime is 14509763. The next prime is 14509799. The reversal of 14509768 is 86790541.
It is a self number, because there is not a number n which added to its sum of digits gives 14509768.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14509763) 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 15 ways as a sum of consecutive naturals, for example, 13308 + ... + 14356.
It is an arithmetic number, because the mean of its divisors is an integer number (551250).
Almost surely, 214509768 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14509768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17640000).
14509768 is an abundant number, since it is smaller than the sum of its proper divisors (20770232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14509768 is a wasteful number, since it uses less digits than its factorization.
14509768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1094 (or 1090 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 40.
The square root of 14509768 is about 3809.1689382331. The cubic root of 14509768 is about 243.9046926888.
The spelling of 14509768 in words is "fourteen million, five hundred nine thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •