Base | Representation |
---|---|
bin | 11000101011010000… |
… | …11000101001010000 |
3 | 1021012021002111001101 |
4 | 30111220120221100 |
5 | 204112414411003 |
6 | 10030322314144 |
7 | 646202346100 |
oct | 142550305120 |
9 | 37167074041 |
10 | 13247810128 |
11 | 5689052913 |
12 | 26987b8954 |
13 | 1331828707 |
14 | 8d9635200 |
15 | 5280a211d |
hex | 315a18a50 |
13247810128 has 60 divisors (see below), whose sum is σ = 30076453332. Its totient is φ = 5636144640.
The previous prime is 13247810087. The next prime is 13247810129. The reversal of 13247810128 is 82101874231.
It can be written as a sum of positive squares in 2 ways, for example, as 10931120704 + 2316689424 = 104552^2 + 48132^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13247810129) 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 11 ways as a sum of consecutive naturals, for example, 45738 + ... + 169078.
Almost surely, 213247810128 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13247810128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15038226666).
13247810128 is an abundant number, since it is smaller than the sum of its proper divisors (16828643204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13247810128 is a wasteful number, since it uses less digits than its factorization.
13247810128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123500 (or 123487 counting only the distinct ones).
The product of its (nonzero) digits is 21504, while the sum is 37.
The spelling of 13247810128 in words is "thirteen billion, two hundred forty-seven million, eight hundred ten thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •