Base | Representation |
---|---|
bin | 1100001010010001001111… |
… | …1101001100011001010101 |
3 | 1202100012202212120102221022 |
4 | 3002210103331030121111 |
5 | 3223030410402013414 |
6 | 44234204254530525 |
7 | 2546664065550434 |
oct | 302442375143125 |
9 | 52305685512838 |
10 | 13370568001109 |
11 | 4295476080770 |
12 | 15bb380206a45 |
13 | 75caba8054a7 |
14 | 3431d339711b |
15 | 182bec25318e |
hex | c2913f4c655 |
13370568001109 has 4 divisors (see below), whose sum is σ = 14586074183040. Its totient is φ = 12155061819180.
The previous prime is 13370568001081. The next prime is 13370568001163. The reversal of 13370568001109 is 90110086507331.
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 a de Polignac number, because none of the positive numbers 2k-13370568001109 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13370568001109.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13370568001199) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 607753090949 + ... + 607753090970.
It is an arithmetic number, because the mean of its divisors is an integer number (3646518545760).
Almost surely, 213370568001109 is an apocalyptic number.
It is an amenable number.
13370568001109 is a deficient number, since it is larger than the sum of its proper divisors (1215506181931).
13370568001109 is a wasteful number, since it uses less digits than its factorization.
13370568001109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1215506181930.
The product of its (nonzero) digits is 136080, while the sum is 44.
The spelling of 13370568001109 in words is "thirteen trillion, three hundred seventy billion, five hundred sixty-eight million, one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •