Base | Representation |
---|---|
bin | 1001010010001101110… |
… | …10101111011100100101 |
3 | 1010111102212111012212012 |
4 | 10221012322233130211 |
5 | 20211321422234332 |
6 | 402315441404005 |
7 | 32022356006624 |
oct | 4510672573445 |
9 | 1114385435765 |
10 | 319017383717 |
11 | 113326aa614a |
12 | 519b2339605 |
13 | 24110a74996 |
14 | 11624b236bb |
15 | 847202e3b2 |
hex | 4a46eaf725 |
319017383717 has 2 divisors, whose sum is σ = 319017383718. Its totient is φ = 319017383716.
The previous prime is 319017383653. The next prime is 319017383719. The reversal of 319017383717 is 717383710913.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 259367136961 + 59650246756 = 509281^2 + 244234^2 .
It is an emirp because it is prime and its reverse (717383710913) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 319017383717 - 26 = 319017383653 is a prime.
It is a super-2 number, since 2×3190173837172 (a number of 24 digits) contains 22 as substring.
Together with 319017383719, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (319017383719) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 159508691858 + 159508691859.
It is an arithmetic number, because the mean of its divisors is an integer number (159508691859).
Almost surely, 2319017383717 is an apocalyptic number.
It is an amenable number.
319017383717 is a deficient number, since it is larger than the sum of its proper divisors (1).
319017383717 is an equidigital number, since it uses as much as digits as its factorization.
319017383717 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 666792, while the sum is 50.
The spelling of 319017383717 in words is "three hundred nineteen billion, seventeen million, three hundred eighty-three thousand, seven hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •