Base | Representation |
---|---|
bin | 10011001001111010111… |
… | …100010011001001101001 |
3 | 11122211122210020110110222 |
4 | 103021322330103021221 |
5 | 133031312042320014 |
6 | 2444413230015425 |
7 | 164046462441665 |
oct | 23117274231151 |
9 | 4584583213428 |
10 | 1316322620009 |
11 | 4682818911a1 |
12 | 193141947575 |
13 | 9718996b287 |
14 | 479d32db8a5 |
15 | 24391de708e |
hex | 1327af13269 |
1316322620009 has 2 divisors, whose sum is σ = 1316322620010. Its totient is φ = 1316322620008.
The previous prime is 1316322619987. The next prime is 1316322620047. The reversal of 1316322620009 is 9000262236131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 874230610009 + 442092010000 = 935003^2 + 664900^2 .
It is a cyclic number.
It is not a de Polignac number, because 1316322620009 - 212 = 1316322615913 is a prime.
It is not a weakly prime, because it can be changed into another prime (1316322670009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 658161310004 + 658161310005.
It is an arithmetic number, because the mean of its divisors is an integer number (658161310005).
Almost surely, 21316322620009 is an apocalyptic number.
It is an amenable number.
1316322620009 is a deficient number, since it is larger than the sum of its proper divisors (1).
1316322620009 is an equidigital number, since it uses as much as digits as its factorization.
1316322620009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 35.
The spelling of 1316322620009 in words is "one trillion, three hundred sixteen billion, three hundred twenty-two million, six hundred twenty thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •