Base | Representation |
---|---|
bin | 11011000100010010… |
… | …10110100000100001 |
3 | 1101111201121201200122 |
4 | 31202021112200201 |
5 | 214230032124140 |
6 | 10401540530025 |
7 | 1023050613053 |
oct | 154211264041 |
9 | 41451551618 |
10 | 14531520545 |
11 | 6187734513 |
12 | 29966b0915 |
13 | 14a777c089 |
14 | 9bbd158d3 |
15 | 5a0b25ab5 |
hex | 362256821 |
14531520545 has 4 divisors (see below), whose sum is σ = 17437824660. Its totient is φ = 11625216432.
The previous prime is 14531520539. The next prime is 14531520569. The reversal of 14531520545 is 54502513541.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 54502513541 = 7 ⋅7786073363.
It can be written as a sum of positive squares in 2 ways, for example, as 2438779456 + 12092741089 = 49384^2 + 109967^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14531520545 is a prime.
It is a super-2 number, since 2×145315205452 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1453152050 + ... + 1453152059.
It is an arithmetic number, because the mean of its divisors is an integer number (4359456165).
Almost surely, 214531520545 is an apocalyptic number.
It is an amenable number.
14531520545 is a deficient number, since it is larger than the sum of its proper divisors (2906304115).
14531520545 is an equidigital number, since it uses as much as digits as its factorization.
14531520545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2906304114.
The product of its (nonzero) digits is 60000, while the sum is 35.
The spelling of 14531520545 in words is "fourteen billion, five hundred thirty-one million, five hundred twenty thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •