Base | Representation |
---|---|
bin | 1011111010110000101100… |
… | …1100101101110111111100 |
3 | 1201101202001120022021002210 |
4 | 2332230023030231313330 |
5 | 3204144231033244400 |
6 | 43511542230220420 |
7 | 2521512430360224 |
oct | 276541314556774 |
9 | 51352046267083 |
10 | 13104133103100 |
11 | 41a2482570386 |
12 | 15778037b4710 |
13 | 7409398505a0 |
14 | 334359d67084 |
15 | 17ad06689950 |
hex | beb0b32ddfc |
13104133103100 has 144 divisors (see below), whose sum is σ = 41523188595840. Its totient is φ = 3170960966400.
The previous prime is 13104133103071. The next prime is 13104133103111. The reversal of 13104133103100 is 130133140131.
It is a super-2 number, since 2×131041331031002 (a number of 27 digits) contains 22 as substring.
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, 28244766 + ... + 28704965.
It is an arithmetic number, because the mean of its divisors is an integer number (288355476360).
Almost surely, 213104133103100 is an apocalyptic number.
13104133103100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13104133103100 is an abundant number, since it is smaller than the sum of its proper divisors (28419055492740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13104133103100 is a wasteful number, since it uses less digits than its factorization.
13104133103100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56949820 (or 56949813 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 13104133103100 its reverse (130133140131), we get a palindrome (13234266243231).
The spelling of 13104133103100 in words is "thirteen trillion, one hundred four billion, one hundred thirty-three million, one hundred three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.161 sec. • engine limits •