Base | Representation |
---|---|
bin | 1011111010010101100111… |
… | …0010101100100000010001 |
3 | 1201101001021210222010000122 |
4 | 2332211121302230200101 |
5 | 3204034333101402332 |
6 | 43504340520000025 |
7 | 2521134305022023 |
oct | 276453162544021 |
9 | 51331253863018 |
10 | 13096861747217 |
11 | 419a391027056 |
12 | 1576314600015 |
13 | 74004b268641 |
14 | 333c6a372013 |
15 | 17aa2d11dc12 |
hex | be959cac811 |
13096861747217 has 2 divisors, whose sum is σ = 13096861747218. Its totient is φ = 13096861747216.
The previous prime is 13096861747141. The next prime is 13096861747219. The reversal of 13096861747217 is 71274716869031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12828997534081 + 267864213136 = 3581759^2 + 517556^2 .
It is a cyclic number.
It is not a de Polignac number, because 13096861747217 - 220 = 13096860698641 is a prime.
Together with 13096861747219, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13096861747217.
It is not a weakly prime, because it can be changed into another prime (13096861747219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6548430873608 + 6548430873609.
It is an arithmetic number, because the mean of its divisors is an integer number (6548430873609).
Almost surely, 213096861747217 is an apocalyptic number.
It is an amenable number.
13096861747217 is a deficient number, since it is larger than the sum of its proper divisors (1).
13096861747217 is an equidigital number, since it uses as much as digits as its factorization.
13096861747217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21337344, while the sum is 62.
The spelling of 13096861747217 in words is "thirteen trillion, ninety-six billion, eight hundred sixty-one million, seven hundred forty-seven thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •