Base | Representation |
---|---|
bin | 1011111010110001011100… |
… | …0000110111111010111000 |
3 | 1201101202120101021222120210 |
4 | 2332230113000313322320 |
5 | 3204200132304400422 |
6 | 43512014030551120 |
7 | 2521520355261036 |
oct | 276542700677270 |
9 | 51352511258523 |
10 | 13104331325112 |
11 | 41a2574449525 |
12 | 157785a0684a0 |
13 | 74096b934511 |
14 | 334378405556 |
15 | 17ad18c9210c |
hex | beb17037eb8 |
13104331325112 has 64 divisors (see below), whose sum is σ = 33080424001920. Its totient is φ = 4325530819968.
The previous prime is 13104331325027. The next prime is 13104331325153. The reversal of 13104331325112 is 21152313340131.
It is a self number, because there is not a number n which added to its sum of digits gives 13104331325112.
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, 5301018 + ... + 7369494.
It is an arithmetic number, because the mean of its divisors is an integer number (516881625030).
Almost surely, 213104331325112 is an apocalyptic number.
13104331325112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13104331325112 is an abundant number, since it is smaller than the sum of its proper divisors (19976092676808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13104331325112 is a wasteful number, since it uses less digits than its factorization.
13104331325112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2071060 (or 2071056 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 30.
Adding to 13104331325112 its reverse (21152313340131), we get a palindrome (34256644665243).
The spelling of 13104331325112 in words is "thirteen trillion, one hundred four billion, three hundred thirty-one million, three hundred twenty-five thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •