Base | Representation |
---|---|
bin | 110011101010… |
… | …111000101001 |
3 | 221111011020201 |
4 | 303222320221 |
5 | 11431420001 |
6 | 1202152201 |
7 | 223062541 |
oct | 63527051 |
9 | 27434221 |
10 | 13545001 |
11 | 7711618 |
12 | 4652661 |
13 | 2a632c2 |
14 | 1b28321 |
15 | 12c8501 |
hex | ceae29 |
13545001 has 8 divisors (see below), whose sum is σ = 14053320. Its totient is φ = 13039488.
The previous prime is 13544987. The next prime is 13545011. The reversal of 13545001 is 10054531.
It can be written as a sum of positive squares in 4 ways, for example, as 331776 + 13213225 = 576^2 + 3635^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13545001 - 25 = 13544969 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13545001.
It is not an unprimeable number, because it can be changed into a prime (13545011) 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 7 ways as a sum of consecutive naturals, for example, 17515 + ... + 18271.
It is an arithmetic number, because the mean of its divisors is an integer number (1756665).
Almost surely, 213545001 is an apocalyptic number.
It is an amenable number.
13545001 is a deficient number, since it is larger than the sum of its proper divisors (508319).
13545001 is an equidigital number, since it uses as much as digits as its factorization.
13545001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1403.
The product of its (nonzero) digits is 300, while the sum is 19.
The square root of 13545001 is about 3680.3533797721. The cubic root of 13545001 is about 238.3744370835.
Adding to 13545001 its reverse (10054531), we get a palindrome (23599532).
The spelling of 13545001 in words is "thirteen million, five hundred forty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •