Base | Representation |
---|---|
bin | 1011111010110001110110… |
… | …0111011100111000110100 |
3 | 1201101202212002201222221120 |
4 | 2332230131213130320310 |
5 | 3204200344134220200 |
6 | 43512033025143540 |
7 | 2521523201664504 |
oct | 276543547347064 |
9 | 51352762658846 |
10 | 13104442101300 |
11 | 41a2620a302a0 |
12 | 157788b18abb0 |
13 | 74098887bc64 |
14 | 334388ddda04 |
15 | 17ad238749a0 |
hex | beb1d9dce34 |
13104442101300 has 144 divisors (see below), whose sum is σ = 41377863438912. Its totient is φ = 3175645593600.
The previous prime is 13104442101299. The next prime is 13104442101319. The reversal of 13104442101300 is 310124440131.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 8092404 + ... + 9575796.
Almost surely, 213104442101300 is an apocalyptic number.
13104442101300 is a gapful number since it is divisible by the number (10) 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 13104442101300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20688931719456).
13104442101300 is an abundant number, since it is smaller than the sum of its proper divisors (28273421337612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13104442101300 is a wasteful number, since it uses less digits than its factorization.
13104442101300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1486098 (or 1486091 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 13104442101300 its reverse (310124440131), we get a palindrome (13414566541431).
The spelling of 13104442101300 in words is "thirteen trillion, one hundred four billion, four hundred forty-two million, one hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •