Base | Representation |
---|---|
bin | 10011000111001110001… |
… | …110110001101111011101 |
3 | 11122120011211212101200022 |
4 | 103013032032301233131 |
5 | 133004343300134113 |
6 | 2443213520041525 |
7 | 163614616225244 |
oct | 23071616615735 |
9 | 4576154771608 |
10 | 1313425005533 |
11 | 4670251a1593 |
12 | 1926734632a5 |
13 | 96b175542b4 |
14 | 477da54795b |
15 | 24272829908 |
hex | 131ce3b1bdd |
1313425005533 has 2 divisors, whose sum is σ = 1313425005534. Its totient is φ = 1313425005532.
The previous prime is 1313425005491. The next prime is 1313425005547. The reversal of 1313425005533 is 3355005243131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1242339847609 + 71085157924 = 1114603^2 + 266618^2 .
It is a cyclic number.
It is not a de Polignac number, because 1313425005533 - 210 = 1313425004509 is a prime.
It is a super-2 number, since 2×13134250055332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1313425005493 and 1313425005502.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1313425005583) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656712502766 + 656712502767.
It is an arithmetic number, because the mean of its divisors is an integer number (656712502767).
Almost surely, 21313425005533 is an apocalyptic number.
It is an amenable number.
1313425005533 is a deficient number, since it is larger than the sum of its proper divisors (1).
1313425005533 is an equidigital number, since it uses as much as digits as its factorization.
1313425005533 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 81000, while the sum is 35.
The spelling of 1313425005533 in words is "one trillion, three hundred thirteen billion, four hundred twenty-five million, five thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •