Base | Representation |
---|---|
bin | 1100000001011000010111… |
… | …1000010110010101000111 |
3 | 1201210121121102111011221001 |
4 | 3000112011320112111013 |
5 | 3213030134242323142 |
6 | 44040111251234131 |
7 | 2532646622366233 |
oct | 300260570262507 |
9 | 51717542434831 |
10 | 13217860511047 |
11 | 4236732740225 |
12 | 15958628a8947 |
13 | 74b59234930a |
14 | 339a681c35c3 |
15 | 17dc60b0e5b7 |
hex | c0585e16547 |
13217860511047 has 2 divisors, whose sum is σ = 13217860511048. Its totient is φ = 13217860511046.
The previous prime is 13217860510927. The next prime is 13217860511153. The reversal of 13217860511047 is 74011506871231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13217860511047 - 211 = 13217860508999 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13217860510988 and 13217860511006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13317860511047) 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, 6608930255523 + 6608930255524.
It is an arithmetic number, because the mean of its divisors is an integer number (6608930255524).
Almost surely, 213217860511047 is an apocalyptic number.
13217860511047 is a deficient number, since it is larger than the sum of its proper divisors (1).
13217860511047 is an equidigital number, since it uses as much as digits as its factorization.
13217860511047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 282240, while the sum is 46.
The spelling of 13217860511047 in words is "thirteen trillion, two hundred seventeen billion, eight hundred sixty million, five hundred eleven thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •