Base | Representation |
---|---|
bin | 10010111101101000000… |
… | …001011100111111000001 |
3 | 11121120120200202012220112 |
4 | 102331220001130333001 |
5 | 132322242244131032 |
6 | 2434351210321105 |
7 | 163101351543662 |
oct | 22755001347701 |
9 | 4546520665815 |
10 | 1303120302017 |
11 | 462717490296 |
12 | 190678429195 |
13 | 95b646b01b1 |
14 | 470ddb49369 |
15 | 23d6cd2e1b2 |
hex | 12f6805cfc1 |
1303120302017 has 2 divisors, whose sum is σ = 1303120302018. Its totient is φ = 1303120302016.
The previous prime is 1303120301971. The next prime is 1303120302019. The reversal of 1303120302017 is 7102030213031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1302887556481 + 232745536 = 1141441^2 + 15256^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1303120302017 is a prime.
Together with 1303120302019, 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 = 1303120301983 and 1303120302001.
It is not a weakly prime, because it can be changed into another prime (1303120302019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 651560151008 + 651560151009.
It is an arithmetic number, because the mean of its divisors is an integer number (651560151009).
Almost surely, 21303120302017 is an apocalyptic number.
It is an amenable number.
1303120302017 is a deficient number, since it is larger than the sum of its proper divisors (1).
1303120302017 is an equidigital number, since it uses as much as digits as its factorization.
1303120302017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 756, while the sum is 23.
Adding to 1303120302017 its reverse (7102030213031), we get a palindrome (8405150515048).
The spelling of 1303120302017 in words is "one trillion, three hundred three billion, one hundred twenty million, three hundred two thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •