Base | Representation |
---|---|
bin | 1011111010111011111100… |
… | …0101100100010010011100 |
3 | 1201102000211220020210112222 |
4 | 2332232333011210102130 |
5 | 3204221421142041313 |
6 | 43513201521044512 |
7 | 2521650265223621 |
oct | 276567705442234 |
9 | 51360756223488 |
10 | 13107151127708 |
11 | 41a37911219a0 |
12 | 1578306486738 |
13 | 740ccaba6071 |
14 | 334564b02348 |
15 | 17ae315de208 |
hex | bebbf16449c |
13107151127708 has 12 divisors (see below), whose sum is σ = 25022743062072. Its totient is φ = 5957795967120.
The previous prime is 13107151127683. The next prime is 13107151127713. The reversal of 13107151127708 is 80772115170131.
It is a super-2 number, since 2×131071511277082 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (44), and also a Moran number because the ratio is a prime number: 297889798357 = 13107151127708 / (1 + 3 + 1 + 0 + 7 + 1 + 5 + 1 + 1 + 2 + 7 + 7 + 0 + 8).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 148944899135 + ... + 148944899222.
It is an arithmetic number, because the mean of its divisors is an integer number (2085228588506).
Almost surely, 213107151127708 is an apocalyptic number.
It is an amenable number.
13107151127708 is a deficient number, since it is larger than the sum of its proper divisors (11915591934364).
13107151127708 is a wasteful number, since it uses less digits than its factorization.
13107151127708 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297889798372 (or 297889798370 counting only the distinct ones).
The product of its (nonzero) digits is 82320, while the sum is 44.
Adding to 13107151127708 its reverse (80772115170131), we get a palindrome (93879266297839).
The spelling of 13107151127708 in words is "thirteen trillion, one hundred seven billion, one hundred fifty-one million, one hundred twenty-seven thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •