Base | Representation |
---|---|
bin | 1100001100101000000100… |
… | …1100000010000011110100 |
3 | 1202111002021111120222212112 |
4 | 3003022001030002003310 |
5 | 3224211320130010030 |
6 | 44304542002310152 |
7 | 2552626311202142 |
oct | 303120114020364 |
9 | 52432244528775 |
10 | 13411055313140 |
11 | 430066210a521 |
12 | 160719b358358 |
13 | 763870819964 |
14 | 345154576592 |
15 | 183cbb8e8a95 |
hex | c32813020f4 |
13411055313140 has 48 divisors (see below), whose sum is σ = 28228313830080. Its totient is φ = 5352030754560.
The previous prime is 13411055313137. The next prime is 13411055313167. The reversal of 13411055313140 is 4131355011431.
It is a super-2 number, since 2×134110553131402 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13411055313097 and 13411055313106.
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, 26115371 + ... + 26623949.
It is an arithmetic number, because the mean of its divisors is an integer number (588089871460).
Almost surely, 213411055313140 is an apocalyptic number.
13411055313140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13411055313140 is an abundant number, since it is smaller than the sum of its proper divisors (14817258516940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13411055313140 is a wasteful number, since it uses less digits than its factorization.
13411055313140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 511632 (or 511630 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 32.
The spelling of 13411055313140 in words is "thirteen trillion, four hundred eleven billion, fifty-five million, three hundred thirteen thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •