14190
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 38016
- Proper Divisor Sum (Aliquot Sum)
- 23826
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3360
- Möbius Function
- -1
- Radical
- 14190
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- yes
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 58
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Tetrahedral (or triangular pyramidal) numbers: a(n) = C(n+2,3) = n*(n+1)*(n+2)/6.at n=43A000292
- a(n) = 1^2 + 3^2 + 5^2 + 7^2 + ... + (2*n-1)^2 = n*(4*n^2 - 1)/3.at n=22A000447
- Binomial coefficient C(3n,n-12).at n=3A004330
- Binomial coefficient C(5n, n-6).at n=3A004348
- Maximal iterated binomial coefficients.at n=11A006543
- Dodecahedral numbers: a(n) = n*(3*n - 1)*(3*n - 2)/2.at n=15A006566
- Binomial coefficient C(45,n).at n=3A010961
- Binomial coefficient C(n,42).at n=3A010995
- Even tetrahedral numbers.at n=32A015220
- Row/column pre-periods of Sprague-Grundy values of Wythoff's Game.at n=44A046874
- a(n) = lcm(n, n+1, n+2)/6.at n=42A067046
- Squarefree tetrahedral numbers.at n=14A070755
- a(n) = rad(n(n+1)(n+2)), where rad(m) is the largest squarefree number dividing m (see A007947).at n=42A078637
- a(n) = binomial(n, smallest prime factor of n).at n=44A080211
- Binomial(n, smallest odd prime factor of n).at n=44A080212
- Numbers k such that the three second-degree cyclotomic polynomials x^2 + 1, x^2 - x + 1 and x^2 + x + 1 are simultaneously prime when evaluated at x=k.at n=13A087277
- a(n) = n*(n-1)*(n-2)*(n-3)*(n^2-3*n-2)/48.at n=11A093566
- a(n) = (n+1)*(n+2)*(n+3)*(n+4)*(19*n^2 + 47*n + 30)/720.at n=7A108677
- Riordan array (1/sqrt(1-6x+5x^2),x/(1-6x+5x^2)).at n=50A111965
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n and having k ascents (0<=k<=floor(n/3)).at n=48A114712