319
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 360
- Proper Divisor Sum (Aliquot Sum)
- 41
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 280
- Möbius Function
- 1
- Radical
- 319
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 55
- Smith Number
- yes
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- dreihundertneunzehn· ordinal: dreihundertneunzehnste
- English
- three hundred nineteen· ordinal: three hundred nineteenth
- Spanish
- trescientos diecinueve· ordinal: 319º
- French
- trois cent dix-neuf· ordinal: trois cent dix-neufième
- Italian
- trecentodiciannove· ordinal: 319º
- Latin
- trecenti undeviginti· ordinal: 319.
- Portuguese
- trezentos e dezenove· ordinal: 319º
Appears in sequences
- A nonlinear binomial sum.at n=9A000128
- Number of 3-line partitions of n.at n=10A000991
- Number of n-node rooted trees of height at most 3.at n=11A001383
- Number of partitions of n with exactly two part sizes.at n=43A002133
- Inverse of reduced totient function.at n=53A002396
- Odd squarefree numbers with an even number of prime factors that have no prime factors greater than 31.at n=32A002557
- Numbers k such that (k^2 + k + 1)/21 is prime.at n=17A002644
- Numbers k such that (4*k^2 + 1)/5 is prime.at n=51A002732
- Ulam numbers: a(1) = 1; a(2) = 2; for n>2, a(n) = least number > a(n-1) which is a unique sum of two distinct earlier terms.at n=56A002858
- Problimes (second definition).at n=56A003067
- Add 4, then reverse digits; start with 0.at n=19A003608
- Numbers k such that cos(k-1) <= 0 and cos(k) > 0.at n=50A004083
- Numbers that are the sum of 4 but no fewer nonzero squares.at n=51A004215
- a(n) = floor(Fibonacci(n)/5).at n=17A004698
- a(n) = 8*n + 7. Or, numbers whose binary expansion ends in 111.at n=39A004771
- a(n) = floor(n*phi^7), where phi is the golden ratio, A001622.at n=11A004922
- a(n) = round(n*phi^7), where phi is the golden ratio, A001622.at n=11A004942
- T is the first, fourth, eleventh, ... letter in this sentence, not counting spaces or commas (Aronson's sequence).at n=55A005224
- Starts 0, 4 and contains no 3-term arithmetic progression.at n=47A005487
- G.f.: x*(1-x^2)*(x^4+x^3-x^2+x+1) / (x^8-4*x^6-x^4-4*x^2+1).at n=10A005822