Base | Representation |
---|---|
bin | 10011001101011110001… |
… | …111110011010100000001 |
3 | 11200012111120002101120212 |
4 | 103031132033303110001 |
5 | 133112114324114023 |
6 | 2450243455243505 |
7 | 164243130134612 |
oct | 23153617632401 |
9 | 4605446071525 |
10 | 1320136160513 |
11 | 4699594a0665 |
12 | 193a26b19595 |
13 | 97646a66911 |
14 | 47c75995c09 |
15 | 24516ad9e78 |
hex | 1335e3f3501 |
1320136160513 has 2 divisors, whose sum is σ = 1320136160514. Its totient is φ = 1320136160512.
The previous prime is 1320136160351. The next prime is 1320136160521. The reversal of 1320136160513 is 3150616310231.
Together with previous prime (1320136160351) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1299536160784 + 20599999729 = 1139972^2 + 143527^2 .
It is a cyclic number.
It is not a de Polignac number, because 1320136160513 - 220 = 1320135111937 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1320136160513.
It is not a weakly prime, because it can be changed into another prime (1320136160543) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 660068080256 + 660068080257.
It is an arithmetic number, because the mean of its divisors is an integer number (660068080257).
Almost surely, 21320136160513 is an apocalyptic number.
It is an amenable number.
1320136160513 is a deficient number, since it is larger than the sum of its proper divisors (1).
1320136160513 is an equidigital number, since it uses as much as digits as its factorization.
1320136160513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 32.
The spelling of 1320136160513 in words is "one trillion, three hundred twenty billion, one hundred thirty-six million, one hundred sixty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •