Base | Representation |
---|---|
bin | 11000011011100010… |
… | …01111110111000101 |
3 | 1020212001220112221012 |
4 | 30031301033313011 |
5 | 203330133300332 |
6 | 10005251332005 |
7 | 643011305222 |
oct | 141561176705 |
9 | 36761815835 |
10 | 13115915717 |
11 | 5620657673 |
12 | 26605b1005 |
13 | 13103c8898 |
14 | 8c5d00949 |
15 | 51b6ec3b2 |
hex | 30dc4fdc5 |
13115915717 has 2 divisors, whose sum is σ = 13115915718. Its totient is φ = 13115915716.
The previous prime is 13115915677. The next prime is 13115915731. The reversal of 13115915717 is 71751951131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11222012356 + 1893903361 = 105934^2 + 43519^2 .
It is a cyclic number.
It is not a de Polignac number, because 13115915717 - 26 = 13115915653 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13115915017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6557957858 + 6557957859.
It is an arithmetic number, because the mean of its divisors is an integer number (6557957859).
Almost surely, 213115915717 is an apocalyptic number.
It is an amenable number.
13115915717 is a deficient number, since it is larger than the sum of its proper divisors (1).
13115915717 is an equidigital number, since it uses as much as digits as its factorization.
13115915717 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 33075, while the sum is 41.
The spelling of 13115915717 in words is "thirteen billion, one hundred fifteen million, nine hundred fifteen thousand, seven hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •