Base | Representation |
---|---|
bin | 10011000111011001111… |
… | …111000010001010101001 |
3 | 11122120200120221011121212 |
4 | 103013121333002022221 |
5 | 133010244241030342 |
6 | 2443245242442505 |
7 | 163622532340136 |
oct | 23073177021251 |
9 | 4576616834555 |
10 | 1313622205097 |
11 | 467116541534 |
12 | 192709503435 |
13 | 96b4936aa27 |
14 | 478187db58d |
15 | 24284cce182 |
hex | 131d9fc22a9 |
1313622205097 has 2 divisors, whose sum is σ = 1313622205098. Its totient is φ = 1313622205096.
The previous prime is 1313622205081. The next prime is 1313622205099. The reversal of 1313622205097 is 7905022263131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1172865174121 + 140757030976 = 1082989^2 + 375176^2 .
It is a cyclic number.
It is not a de Polignac number, because 1313622205097 - 24 = 1313622205081 is a prime.
Together with 1313622205099, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1313622205099) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656811102548 + 656811102549.
It is an arithmetic number, because the mean of its divisors is an integer number (656811102549).
Almost surely, 21313622205097 is an apocalyptic number.
It is an amenable number.
1313622205097 is a deficient number, since it is larger than the sum of its proper divisors (1).
1313622205097 is an equidigital number, since it uses as much as digits as its factorization.
1313622205097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 136080, while the sum is 41.
The spelling of 1313622205097 in words is "one trillion, three hundred thirteen billion, six hundred twenty-two million, two hundred five thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •