Base | Representation |
---|---|
bin | 1011111010110001011100… |
… | …0011011111111011110100 |
3 | 1201101202120102120221121020 |
4 | 2332230113003133323310 |
5 | 3204200132443411200 |
6 | 43512014053421140 |
7 | 2521520364155313 |
oct | 276542703377364 |
9 | 51352512527536 |
10 | 13104332013300 |
11 | 41a2574879580 |
12 | 157785a33a7b0 |
13 | 74096bb15828 |
14 | 33437854427a |
15 | 17ad18d7aea0 |
hex | beb170dfef4 |
13104332013300 has 144 divisors (see below), whose sum is σ = 42788314497600. Its totient is φ = 3067262643200.
The previous prime is 13104332013299. The next prime is 13104332013307. The reversal of 13104332013300 is 331023340131.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13104332013307) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 68369985 + ... + 68561384.
It is an arithmetic number, because the mean of its divisors is an integer number (297141072900).
Almost surely, 213104332013300 is an apocalyptic number.
13104332013300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13104332013300 is an abundant number, since it is smaller than the sum of its proper divisors (29683982484300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13104332013300 is a wasteful number, since it uses less digits than its factorization.
13104332013300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136931426 (or 136931419 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 13104332013300 its reverse (331023340131), we get a palindrome (13435355353431).
The spelling of 13104332013300 in words is "thirteen trillion, one hundred four billion, three hundred thirty-two million, thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •