Base | Representation |
---|---|
bin | 10011000100001111001… |
… | …101110101110111010001 |
3 | 11122020220111200002121212 |
4 | 103010033031311313101 |
5 | 132431312344441032 |
6 | 2441523520225505 |
7 | 163442323616411 |
oct | 23041715656721 |
9 | 4566814602555 |
10 | 1310220312017 |
11 | 465730232951 |
12 | 191b1a16b295 |
13 | 96726631346 |
14 | 475b4a9a641 |
15 | 24136300bb2 |
hex | 1310f375dd1 |
1310220312017 has 2 divisors, whose sum is σ = 1310220312018. Its totient is φ = 1310220312016.
The previous prime is 1310220311957. The next prime is 1310220312019. The reversal of 1310220312017 is 7102130220131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 688450213441 + 621770098576 = 829729^2 + 788524^2 .
It is a cyclic number.
It is not a de Polignac number, because 1310220312017 - 214 = 1310220295633 is a prime.
Together with 1310220312019, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1310220311983 and 1310220312001.
It is not a weakly prime, because it can be changed into another prime (1310220312019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655110156008 + 655110156009.
It is an arithmetic number, because the mean of its divisors is an integer number (655110156009).
Almost surely, 21310220312017 is an apocalyptic number.
It is an amenable number.
1310220312017 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310220312017 is an equidigital number, since it uses as much as digits as its factorization.
1310220312017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 504, while the sum is 23.
Adding to 1310220312017 its reverse (7102130220131), we get a palindrome (8412350532148).
The spelling of 1310220312017 in words is "one trillion, three hundred ten billion, two hundred twenty million, three hundred twelve thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •