319 = 1 × 23 × 4 + 5 × 6 × 7 + 8 + 9
319 = 98 + 7 × 6 × 5 + 4 + 3 × 2 + 1
319 = 0^5 + 1^8 + 2^7 − 3^9 + 4^3 + 5^6 + 6^1 + 7^0 + 8^4 + 9^2
319 divides 12^4 - 1.
319 = 11 × ((1 + 1 + 1) × (11 − 1) − 1)
319 = 2(2+2) × (22 − 2) − 2/2
319 = 333 − 3 − 33/3
319 = 44 + (44 − 4)/4
319 = (55 + 5)/(5 + 5) + 5 + 5/5
319 = 66 + 6 × (6 × 6 + 6) + 6/6
319 = 7 × 7 × 7 − 7 − 7 − (77 − 7)/7
319 = (8 + 8) × (8 + 8) + 8 × 8 − 8/8
319 = 99 × (9 + 9 + 99/9)/9
Toothpick sequence a(n), n = 25
Numbers k such that 2^k + 9 is prime.
Conjecturally, largest attractor in '3x+(2n+1)' problem, n = 6
319 cannot be written as a sum of 3 squares. (Integers that are not a sum of three squares)
Semiprime (Product of 2 Primes)
Factors: 1, 11, 29, 319
Three hundred nineteen
Representations, Binary to Hexadecimal:
100111111_2
102211_3
10333_4
2234_5
1251_6
634_7
477_8
384_9
270_11
227_12
1b7_13
18b_14
164_15
13f_16
<--- --->
Undergraduate Texts in Mathematics
Graduate Studies in Mathematics
