Base | Representation |
---|---|
bin | 1011111010110001011001… |
… | …1110001011100000011100 |
3 | 1201101202112202011220211220 |
4 | 2332230112132023200130 |
5 | 3204200122442332200 |
6 | 43512013104013340 |
7 | 2521520215051410 |
oct | 276542636134034 |
9 | 51352482156756 |
10 | 13104322230300 |
11 | 41a256a2a7454 |
12 | 1577857001250 |
13 | 740969a9b982 |
14 | 334377118d40 |
15 | 17ad180974a0 |
hex | beb1678b81c |
13104322230300 has 72 divisors (see below), whose sum is σ = 43331625515136. Its totient is φ = 2995273652160.
The previous prime is 13104322230271. The next prime is 13104322230313. The reversal of 13104322230300 is 303222340131.
It is a super-2 number, since 2×131043222303002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3120074622 + ... + 3120078821.
Almost surely, 213104322230300 is an apocalyptic number.
13104322230300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13104322230300 is an abundant number, since it is smaller than the sum of its proper divisors (30227303284836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13104322230300 is a wasteful number, since it uses less digits than its factorization.
13104322230300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6240153467 (or 6240153460 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 13104322230300 its reverse (303222340131), we get a palindrome (13407544570431).
The spelling of 13104322230300 in words is "thirteen trillion, one hundred four billion, three hundred twenty-two million, two hundred thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •