Base | Representation |
---|---|
bin | 11000100101110100… |
… | …00001101011100100 |
3 | 1021002002002022200020 |
4 | 30102322001223210 |
5 | 204014214244022 |
6 | 10022010515140 |
7 | 645106011150 |
oct | 142272015344 |
9 | 37062068606 |
10 | 13202103012 |
11 | 566527443a |
12 | 2685435ab0 |
13 | 1325214297 |
14 | 8d3538060 |
15 | 52407435c |
hex | 312e81ae4 |
13202103012 has 96 divisors (see below), whose sum is σ = 35771473920. Its totient is φ = 3711726720.
The previous prime is 13202103007. The next prime is 13202103043. The reversal of 13202103012 is 21030120231.
It is a junction number, because it is equal to n+sod(n) for n = 13202102982 and 13202103000.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2060598 + ... + 2066994.
It is an arithmetic number, because the mean of its divisors is an integer number (372619520).
Almost surely, 213202103012 is an apocalyptic number.
13202103012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13202103012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17885736960).
13202103012 is an abundant number, since it is smaller than the sum of its proper divisors (22569370908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13202103012 is a wasteful number, since it uses less digits than its factorization.
13202103012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6801 (or 6799 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 13202103012 its reverse (21030120231), we get a palindrome (34232223243).
The spelling of 13202103012 in words is "thirteen billion, two hundred two million, one hundred three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •