Base | Representation |
---|---|
bin | 10011000100111110111… |
… | …000011010111011110001 |
3 | 11122022222020102121111112 |
4 | 103010332320122323301 |
5 | 132434432110044212 |
6 | 2442135124323105 |
7 | 163501204105232 |
oct | 23047670327361 |
9 | 4568866377445 |
10 | 1311020003057 |
11 | 466000682636 |
12 | 192101b43495 |
13 | 968232066cb |
14 | 4764cd85089 |
15 | 24181616422 |
hex | 1313ee1aef1 |
1311020003057 has 2 divisors, whose sum is σ = 1311020003058. Its totient is φ = 1311020003056.
The previous prime is 1311020002937. The next prime is 1311020003063. The reversal of 1311020003057 is 7503000201131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1241332450801 + 69687552256 = 1114151^2 + 263984^2 .
It is a cyclic number.
It is not a de Polignac number, because 1311020003057 - 224 = 1311003225841 is a prime.
It is not a weakly prime, because it can be changed into another prime (1310020003057) 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, 655510001528 + 655510001529.
It is an arithmetic number, because the mean of its divisors is an integer number (655510001529).
Almost surely, 21311020003057 is an apocalyptic number.
It is an amenable number.
1311020003057 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311020003057 is an equidigital number, since it uses as much as digits as its factorization.
1311020003057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630, while the sum is 23.
Adding to 1311020003057 its reverse (7503000201131), we get a palindrome (8814020204188).
The spelling of 1311020003057 in words is "one trillion, three hundred eleven billion, twenty million, three thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •