Base | Representation |
---|---|
bin | 11000010010100011… |
… | …01010111011110100 |
3 | 1020122211001111222202 |
4 | 30021101222323310 |
5 | 203201333413030 |
6 | 5553555444032 |
7 | 641104445252 |
oct | 141121527364 |
9 | 36584044882 |
10 | 13040529140 |
11 | 5592047611 |
12 | 263b2b6618 |
13 | 12ca8c2342 |
14 | 8b9cb95d2 |
15 | 514caa745 |
hex | 30946aef4 |
13040529140 has 12 divisors (see below), whose sum is σ = 27385111236. Its totient is φ = 5216211648.
The previous prime is 13040529127. The next prime is 13040529163. The reversal of 13040529140 is 4192504031.
13040529140 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 2 ways, for example, as 8510431504 + 4530097636 = 92252^2 + 67306^2 .
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 326013209 + ... + 326013248.
It is an arithmetic number, because the mean of its divisors is an integer number (2282092603).
Almost surely, 213040529140 is an apocalyptic number.
13040529140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13040529140 is an abundant number, since it is smaller than the sum of its proper divisors (14344582096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13040529140 is a wasteful number, since it uses less digits than its factorization.
13040529140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 652026466 (or 652026464 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 29.
The spelling of 13040529140 in words is "thirteen billion, forty million, five hundred twenty-nine thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •