Base | Representation |
---|---|
bin | 100111010110001… |
… | …1101010101000001 |
3 | 10102000100000222202 |
4 | 1032230131111001 |
5 | 10200442333223 |
6 | 335002042545 |
7 | 44501112665 |
oct | 11654352501 |
9 | 3360300882 |
10 | 1320277313 |
11 | 618297983 |
12 | 30a1a9455 |
13 | 1806b76a4 |
14 | c74bc8a5 |
15 | 7ad98428 |
hex | 4eb1d541 |
1320277313 has 2 divisors, whose sum is σ = 1320277314. Its totient is φ = 1320277312.
The previous prime is 1320277261. The next prime is 1320277331. The reversal of 1320277313 is 3137720231.
Together with next prime (1320277331) 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., 924585649 + 395691664 = 30407^2 + 19892^2 .
It is an emirp because it is prime and its reverse (3137720231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1320277313 - 26 = 1320277249 is a prime.
It is not a weakly prime, because it can be changed into another prime (1320277333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 660138656 + 660138657.
It is an arithmetic number, because the mean of its divisors is an integer number (660138657).
Almost surely, 21320277313 is an apocalyptic number.
It is an amenable number.
1320277313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1320277313 is an equidigital number, since it uses as much as digits as its factorization.
1320277313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5292, while the sum is 29.
The square root of 1320277313 is about 36335.6204433060. The cubic root of 1320277313 is about 1097.0381237016.
Adding to 1320277313 its reverse (3137720231), we get a palindrome (4457997544).
The spelling of 1320277313 in words is "one billion, three hundred twenty million, two hundred seventy-seven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •