Base | Representation |
---|---|
bin | 11000011000000011… |
… | …11100111010101001 |
3 | 1020210001000021120011 |
4 | 30030001330322221 |
5 | 203300201141022 |
6 | 10002330131521 |
7 | 642205312222 |
oct | 141401747251 |
9 | 36701007504 |
10 | 13086740137 |
11 | 560613a619 |
12 | 2652880ba1 |
13 | 1307351c23 |
14 | 8c20a8249 |
15 | 518d87977 |
hex | 30c07cea9 |
13086740137 has 4 divisors (see below), whose sum is σ = 13086982656. Its totient is φ = 13086497620.
The previous prime is 13086740119. The next prime is 13086740153. The reversal of 13086740137 is 73104768031.
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-13086740137 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
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 13086740137.
It is not an unprimeable number, because it can be changed into a prime (13086740237) 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, 312 + ... + 161782.
It is an arithmetic number, because the mean of its divisors is an integer number (3271745664).
Almost surely, 213086740137 is an apocalyptic number.
It is an amenable number.
13086740137 is a deficient number, since it is larger than the sum of its proper divisors (242519).
13086740137 is an equidigital number, since it uses as much as digits as its factorization.
13086740137 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 242518.
The product of its (nonzero) digits is 84672, while the sum is 40.
The spelling of 13086740137 in words is "thirteen billion, eighty-six million, seven hundred forty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •