Base | Representation |
---|---|
bin | 100011100111101010101011… |
… | …1110100111000100110000001 |
3 | 1112002100121220000222101010121 |
4 | 1013033111113310320212001 |
5 | 312031323201421210433 |
6 | 3030210535452300241 |
7 | 122665156560503404 |
oct | 10717252764704601 |
9 | 1462317800871117 |
10 | 313315042756993 |
11 | 90917188591492 |
12 | 2b182679a71681 |
13 | 105a9635558574 |
14 | 5752759753d3b |
15 | 263509b112c2d |
hex | 11cf557d38981 |
313315042756993 has 2 divisors, whose sum is σ = 313315042756994. Its totient is φ = 313315042756992.
The previous prime is 313315042756939. The next prime is 313315042757021. The reversal of 313315042756993 is 399657240513313.
Together with previous prime (313315042756939) 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., 220135174324209 + 93179868432784 = 14836953^2 + 9652972^2 .
It is a cyclic number.
It is not a de Polignac number, because 313315042756993 - 225 = 313315009202561 is a prime.
It is not a weakly prime, because it can be changed into another prime (313315042726993) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156657521378496 + 156657521378497.
It is an arithmetic number, because the mean of its divisors is an integer number (156657521378497).
Almost surely, 2313315042756993 is an apocalyptic number.
It is an amenable number.
313315042756993 is a deficient number, since it is larger than the sum of its proper divisors (1).
313315042756993 is an equidigital number, since it uses as much as digits as its factorization.
313315042756993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55112400, while the sum is 61.
The spelling of 313315042756993 in words is "three hundred thirteen trillion, three hundred fifteen billion, forty-two million, seven hundred fifty-six thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •