Base | Representation |
---|---|
bin | 110111100110… |
… | …001100011100 |
3 | 1000102110021021 |
4 | 313212030130 |
5 | 12212334424 |
6 | 1240213524 |
7 | 234610600 |
oct | 67461434 |
9 | 30373237 |
10 | 14574364 |
11 | 8254a32 |
12 | 4a6a2a4 |
13 | 30339ac |
14 | 1d15500 |
15 | 142d4e4 |
hex | de631c |
14574364 has 72 divisors (see below), whose sum is σ = 32060448. Its totient is φ = 5765760.
The previous prime is 14574331. The next prime is 14574367. The reversal of 14574364 is 46347541.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14574367) 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 23 ways as a sum of consecutive naturals, for example, 238894 + ... + 238954.
It is an arithmetic number, because the mean of its divisors is an integer number (445284).
Almost surely, 214574364 is an apocalyptic number.
14574364 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14574364, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16030224).
14574364 is an abundant number, since it is smaller than the sum of its proper divisors (17486084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14574364 is a wasteful number, since it uses less digits than its factorization.
14574364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155 (or 146 counting only the distinct ones).
The product of its digits is 40320, while the sum is 34.
The square root of 14574364 is about 3817.6385371064. The cubic root of 14574364 is about 244.2661031286.
The spelling of 14574364 in words is "fourteen million, five hundred seventy-four thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •