Base | Representation |
---|---|
bin | 110101111001… |
… | …110110000100 |
3 | 222120220111020 |
4 | 311321312010 |
5 | 12104134224 |
6 | 1222511140 |
7 | 231051660 |
oct | 65716604 |
9 | 28526436 |
10 | 14130564 |
11 | 7a81558 |
12 | 48954b0 |
13 | 2c099a6 |
14 | 1c3b8a0 |
15 | 1391c79 |
hex | d79d84 |
14130564 has 48 divisors (see below), whose sum is σ = 37968000. Its totient is φ = 4006656.
The previous prime is 14130563. The next prime is 14130581. The reversal of 14130564 is 46503141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14130563) 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, 11952 + ... + 13080.
It is an arithmetic number, because the mean of its divisors is an integer number (791000).
Almost surely, 214130564 is an apocalyptic number.
14130564 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 14130564, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18984000).
14130564 is an abundant number, since it is smaller than the sum of its proper divisors (23837436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14130564 is a wasteful number, since it uses less digits than its factorization.
14130564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1292 (or 1290 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 14130564 is about 3759.0642452610. The cubic root of 14130564 is about 241.7611421870.
The spelling of 14130564 in words is "fourteen million, one hundred thirty thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •