Base | Representation |
---|---|
bin | 10011000111000111100… |
… | …000011111110111001101 |
3 | 11122112212222121210211002 |
4 | 103013013200133313031 |
5 | 133004130411213011 |
6 | 2443154410310045 |
7 | 163612046412353 |
oct | 23070740376715 |
9 | 4575788553732 |
10 | 1313312210381 |
11 | 466a77560956 |
12 | 192641728325 |
13 | 96aca0808c2 |
14 | 477c95857d3 |
15 | 24267998c3b |
hex | 131c781fdcd |
1313312210381 has 2 divisors, whose sum is σ = 1313312210382. Its totient is φ = 1313312210380.
The previous prime is 1313312210333. The next prime is 1313312210443. The reversal of 1313312210381 is 1830122133131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 999450075625 + 313862134756 = 999725^2 + 560234^2 .
It is a cyclic number.
It is not a de Polignac number, because 1313312210381 - 26 = 1313312210317 is a prime.
It is a super-2 number, since 2×13133122103812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1313312210981) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656656105190 + 656656105191.
It is an arithmetic number, because the mean of its divisors is an integer number (656656105191).
Almost surely, 21313312210381 is an apocalyptic number.
It is an amenable number.
1313312210381 is a deficient number, since it is larger than the sum of its proper divisors (1).
1313312210381 is an equidigital number, since it uses as much as digits as its factorization.
1313312210381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 29.
The spelling of 1313312210381 in words is "one trillion, three hundred thirteen billion, three hundred twelve million, two hundred ten thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •