Base | Representation |
---|---|
bin | 11000011110000001… |
… | …00111011011000111 |
3 | 1020220112001121020201 |
4 | 30033000213123013 |
5 | 203401000042412 |
6 | 10011313311331 |
7 | 643353201622 |
oct | 141700473307 |
9 | 36815047221 |
10 | 13136721607 |
11 | 5631378419 |
12 | 2667565547 |
13 | 1314801a69 |
14 | 8c8998db9 |
15 | 51d45be57 |
hex | 30f0276c7 |
13136721607 has 4 divisors (see below), whose sum is σ = 13707883440. Its totient is φ = 12565559776.
The previous prime is 13136721601. The next prime is 13136721667. The reversal of 13136721607 is 70612763131.
13136721607 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 70612763131 = 863 ⋅81822437.
It is a cyclic number.
It is not a de Polignac number, because 13136721607 - 215 = 13136688839 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13136721601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 285580882 + ... + 285580927.
It is an arithmetic number, because the mean of its divisors is an integer number (3426970860).
Almost surely, 213136721607 is an apocalyptic number.
13136721607 is a deficient number, since it is larger than the sum of its proper divisors (571161833).
13136721607 is an equidigital number, since it uses as much as digits as its factorization.
13136721607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 571161832.
The product of its (nonzero) digits is 31752, while the sum is 37.
The spelling of 13136721607 in words is "thirteen billion, one hundred thirty-six million, seven hundred twenty-one thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •