Base | Representation |
---|---|
bin | 10011000111000001000… |
… | …001000101100111011101 |
3 | 11122112121101201020212002 |
4 | 103013001001011213131 |
5 | 133003420022004432 |
6 | 2443135520252045 |
7 | 163606254662543 |
oct | 23070101054735 |
9 | 4575541636762 |
10 | 1313203313117 |
11 | 466a21042813 |
12 | 192611171025 |
13 | 96ab0643457 |
14 | 477b8d19d93 |
15 | 2425d137e62 |
hex | 131c10459dd |
1313203313117 has 2 divisors, whose sum is σ = 1313203313118. Its totient is φ = 1313203313116.
The previous prime is 1313203313099. The next prime is 1313203313137. The reversal of 1313203313117 is 7113133023131.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1215052062436 + 98151250681 = 1102294^2 + 313291^2 .
It is a cyclic number.
It is not a de Polignac number, because 1313203313117 - 210 = 1313203312093 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1313203313117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1313203313137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656601656558 + 656601656559.
It is an arithmetic number, because the mean of its divisors is an integer number (656601656559).
Almost surely, 21313203313117 is an apocalyptic number.
It is an amenable number.
1313203313117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1313203313117 is an equidigital number, since it uses as much as digits as its factorization.
1313203313117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3402, while the sum is 29.
Adding to 1313203313117 its reverse (7113133023131), we get a palindrome (8426336336248).
The spelling of 1313203313117 in words is "one trillion, three hundred thirteen billion, two hundred three million, three hundred thirteen thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •