Base | Representation |
---|---|
bin | 1001000111100101011… |
… | …11010000110000111001 |
3 | 1002221201010021020021012 |
4 | 10203302233100300321 |
5 | 20113124342333032 |
6 | 355533243123305 |
7 | 31431055042025 |
oct | 4436257206071 |
9 | 1087633236235 |
10 | 313310121017 |
11 | 110968439213 |
12 | 5087ab13535 |
13 | 2371153306a |
14 | 11242b57385 |
15 | 823ae6d6b2 |
hex | 48f2bd0c39 |
313310121017 has 2 divisors, whose sum is σ = 313310121018. Its totient is φ = 313310121016.
The previous prime is 313310120993. The next prime is 313310121037. The reversal of 313310121017 is 710121013313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 306283658041 + 7026462976 = 553429^2 + 83824^2 .
It is a cyclic number.
It is not a de Polignac number, because 313310121017 - 236 = 244590644281 is a prime.
It is a super-2 number, since 2×3133101210172 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 313310120983 and 313310121001.
It is not a weakly prime, because it can be changed into another prime (313310121037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156655060508 + 156655060509.
It is an arithmetic number, because the mean of its divisors is an integer number (156655060509).
Almost surely, 2313310121017 is an apocalyptic number.
It is an amenable number.
313310121017 is a deficient number, since it is larger than the sum of its proper divisors (1).
313310121017 is an equidigital number, since it uses as much as digits as its factorization.
313310121017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 378, while the sum is 23.
The spelling of 313310121017 in words is "three hundred thirteen billion, three hundred ten million, one hundred twenty-one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •