Base | Representation |
---|---|
bin | 10011000111000000111… |
… | …000110000111011000001 |
3 | 11122112121020121101211101 |
4 | 103013000320300323001 |
5 | 133003413442144301 |
6 | 2443135401414401 |
7 | 163606230304351 |
oct | 23070070607301 |
9 | 4575536541741 |
10 | 1313201131201 |
11 | 466a1a892483 |
12 | 19261049a401 |
13 | 96ab005b28b |
14 | 477b890cb61 |
15 | 2425cd56701 |
hex | 131c0e30ec1 |
1313201131201 has 2 divisors, whose sum is σ = 1313201131202. Its totient is φ = 1313201131200.
The previous prime is 1313201131199. The next prime is 1313201131331. The reversal of 1313201131201 is 1021311023131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 859227033025 + 453974098176 = 926945^2 + 673776^2 .
It is a cyclic number.
It is not a de Polignac number, because 1313201131201 - 21 = 1313201131199 is a prime.
Together with 1313201131199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1313201191201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656600565600 + 656600565601.
It is an arithmetic number, because the mean of its divisors is an integer number (656600565601).
Almost surely, 21313201131201 is an apocalyptic number.
It is an amenable number.
1313201131201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1313201131201 is an equidigital number, since it uses as much as digits as its factorization.
1313201131201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1313201131201 its reverse (1021311023131), we get a palindrome (2334512154332).
The spelling of 1313201131201 in words is "one trillion, three hundred thirteen billion, two hundred one million, one hundred thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •