Base | Representation |
---|---|
bin | 1011111010111011111010… |
… | …1001001011111110110001 |
3 | 1201102000211101020211100102 |
4 | 2332232332221023332301 |
5 | 3204221412241004423 |
6 | 43513201053402145 |
7 | 2521650145050056 |
oct | 276567651137661 |
9 | 51360741224312 |
10 | 13107143688113 |
11 | 41a3787a00472 |
12 | 1578303a99355 |
13 | 740cc949ca37 |
14 | 334563b2702d |
15 | 17ae30b1ec28 |
hex | bebbea4bfb1 |
13107143688113 has 4 divisors (see below), whose sum is σ = 13175767477248. Its totient is φ = 13038519898980.
The previous prime is 13107143688083. The next prime is 13107143688137. The reversal of 13107143688113 is 31188634170131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13107143688113 - 210 = 13107143687089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13107143688193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34311894281 + ... + 34311894662.
It is an arithmetic number, because the mean of its divisors is an integer number (3293941869312).
Almost surely, 213107143688113 is an apocalyptic number.
It is an amenable number.
13107143688113 is a deficient number, since it is larger than the sum of its proper divisors (68623789135).
13107143688113 is an equidigital number, since it uses as much as digits as its factorization.
13107143688113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68623789134.
The product of its (nonzero) digits is 290304, while the sum is 47.
The spelling of 13107143688113 in words is "thirteen trillion, one hundred seven billion, one hundred forty-three million, six hundred eighty-eight thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •