Base | Representation |
---|---|
bin | 11001001011111001… |
… | …00101010011100001 |
3 | 1021220100011102021200 |
4 | 30211330211103201 |
5 | 210143003242241 |
6 | 10113421311413 |
7 | 656035124232 |
oct | 144574452341 |
9 | 37810142250 |
10 | 13521540321 |
11 | 5809614413 |
12 | 2754405569 |
13 | 1376459343 |
14 | 923b2b089 |
15 | 5421224b6 |
hex | 325f254e1 |
13521540321 has 6 divisors (see below), whose sum is σ = 19531113810. Its totient is φ = 9014360208.
The previous prime is 13521540313. The next prime is 13521540341. The reversal of 13521540321 is 12304512531.
13521540321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 13267584225 + 253956096 = 115185^2 + 15936^2 .
It is not a de Polignac number, because 13521540321 - 23 = 13521540313 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13521540341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 751196676 + ... + 751196693.
It is an arithmetic number, because the mean of its divisors is an integer number (3255185635).
Almost surely, 213521540321 is an apocalyptic number.
It is an amenable number.
13521540321 is a deficient number, since it is larger than the sum of its proper divisors (6009573489).
13521540321 is a wasteful number, since it uses less digits than its factorization.
13521540321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1502393375 (or 1502393372 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The spelling of 13521540321 in words is "thirteen billion, five hundred twenty-one million, five hundred forty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •