Base | Representation |
---|---|
bin | 1100000110110011110100… |
… | …1011101001001111110100 |
3 | 1202010112100112200212202110 |
4 | 3001230331023221033310 |
5 | 3221042143302104022 |
6 | 44151014310411020 |
7 | 2542461133051104 |
oct | 301547513511764 |
9 | 52115315625673 |
10 | 13311130113012 |
11 | 4272244a236a6 |
12 | 15ab952660a70 |
13 | 7573076696c4 |
14 | 340395427204 |
15 | 1813be03700c |
hex | c1b3d2e93f4 |
13311130113012 has 24 divisors (see below), whose sum is σ = 31296397521312. Its totient is φ = 4403172810400.
The previous prime is 13311130112971. The next prime is 13311130113031. The reversal of 13311130113012 is 21031103111331.
It is a self number, because there is not a number n which added to its sum of digits gives 13311130113012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4233818439 + ... + 4233821582.
It is an arithmetic number, because the mean of its divisors is an integer number (1304016563388).
Almost surely, 213311130113012 is an apocalyptic number.
13311130113012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13311130113012 is an abundant number, since it is smaller than the sum of its proper divisors (17985267408300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13311130113012 is a wasteful number, since it uses less digits than its factorization.
13311130113012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8467640159 (or 8467640157 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 13311130113012 its reverse (21031103111331), we get a palindrome (34342233224343).
The spelling of 13311130113012 in words is "thirteen trillion, three hundred eleven billion, one hundred thirty million, one hundred thirteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •