Base | Representation |
---|---|
bin | 1011110100111001000111… |
… | …0011100000010010100101 |
3 | 1201001002211011222212111121 |
4 | 2331032101303200102211 |
5 | 3201021240410443132 |
6 | 43353350020333541 |
7 | 2511313125016561 |
oct | 275162163402245 |
9 | 51032734885447 |
10 | 13003312202917 |
11 | 4163745819883 |
12 | 1560166b442b1 |
13 | 73428cc50bba |
14 | 32d513c9a6a1 |
15 | 1783a534a497 |
hex | bd391ce04a5 |
13003312202917 has 2 divisors, whose sum is σ = 13003312202918. Its totient is φ = 13003312202916.
The previous prime is 13003312202911. The next prime is 13003312203031. The reversal of 13003312202917 is 71920221330031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11037803537761 + 1965508665156 = 3322319^2 + 1401966^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13003312202917 is a prime.
It is a super-2 number, since 2×130033122029172 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13003312202911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6501656101458 + 6501656101459.
It is an arithmetic number, because the mean of its divisors is an integer number (6501656101459).
Almost surely, 213003312202917 is an apocalyptic number.
It is an amenable number.
13003312202917 is a deficient number, since it is larger than the sum of its proper divisors (1).
13003312202917 is an equidigital number, since it uses as much as digits as its factorization.
13003312202917 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 34.
Adding to 13003312202917 its reverse (71920221330031), we get a palindrome (84923533532948).
The spelling of 13003312202917 in words is "thirteen trillion, three billion, three hundred twelve million, two hundred two thousand, nine hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •