Base | Representation |
---|---|
bin | 1011111010101001111111… |
… | …0011000000100111011100 |
3 | 1201101120101222201012111110 |
4 | 2332222133303000213130 |
5 | 3204132033241431022 |
6 | 43511043341222020 |
7 | 2521416660434253 |
oct | 276523763004734 |
9 | 51346358635443 |
10 | 13102331202012 |
11 | 41a1738428428 |
12 | 15773a0261910 |
13 | 740710446120 |
14 | 33422891779a |
15 | 17ac4d3a800c |
hex | bea9fcc09dc |
13102331202012 has 48 divisors (see below), whose sum is σ = 32988490123680. Its totient is φ = 4023566093568.
The previous prime is 13102331202001. The next prime is 13102331202073. The reversal of 13102331202012 is 21020213320131.
It is a self number, because there is not a number n which added to its sum of digits gives 13102331202012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 82424823 + ... + 82583630.
It is an arithmetic number, because the mean of its divisors is an integer number (687260210910).
Almost surely, 213102331202012 is an apocalyptic number.
13102331202012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13102331202012 is an abundant number, since it is smaller than the sum of its proper divisors (19886158921668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13102331202012 is a wasteful number, since it uses less digits than its factorization.
13102331202012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165008982 (or 165008980 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13102331202012 its reverse (21020213320131), we get a palindrome (34122544522143).
The spelling of 13102331202012 in words is "thirteen trillion, one hundred two billion, three hundred thirty-one million, two hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •