Base | Representation |
---|---|
bin | 1100000001010110010111… |
… | …0010111010110100001001 |
3 | 1201210120012220120222220212 |
4 | 3000111211302322310021 |
5 | 3213023033441413323 |
6 | 44035542021530505 |
7 | 2532630365100056 |
oct | 300254562726411 |
9 | 51716186528825 |
10 | 13217322216713 |
11 | 42364868a877a |
12 | 1595732573a35 |
13 | 74b507976b64 |
14 | 339a1690002d |
15 | 17dc2d72eb78 |
hex | c0565cbad09 |
13217322216713 has 2 divisors, whose sum is σ = 13217322216714. Its totient is φ = 13217322216712.
The previous prime is 13217322216697. The next prime is 13217322216731. The reversal of 13217322216713 is 31761222371231.
Together with next prime (13217322216731) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8021147258569 + 5196174958144 = 2832163^2 + 2279512^2 .
It is a cyclic number.
It is not a de Polignac number, because 13217322216713 - 24 = 13217322216697 is a prime.
It is not a weakly prime, because it can be changed into another prime (13217322216013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6608661108356 + 6608661108357.
It is an arithmetic number, because the mean of its divisors is an integer number (6608661108357).
Almost surely, 213217322216713 is an apocalyptic number.
It is an amenable number.
13217322216713 is a deficient number, since it is larger than the sum of its proper divisors (1).
13217322216713 is an equidigital number, since it uses as much as digits as its factorization.
13217322216713 is an evil number, because the sum of its binary digits is even.
The product of its digits is 127008, while the sum is 41.
Adding to 13217322216713 its reverse (31761222371231), we get a palindrome (44978544587944).
The spelling of 13217322216713 in words is "thirteen trillion, two hundred seventeen billion, three hundred twenty-two million, two hundred sixteen thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •