14514
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
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 30240
- Proper Divisor Sum (Aliquot Sum)
- 15726
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4640
- Möbius Function
- 1
- Radical
- 14514
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 71
- 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
- Number of ordered 5-tuples of integers from [ 2,n ] with no common factors among triples.at n=20A015657
- Number of 9's in all partitions of n.at n=42A024793
- Number of partitions satisfying cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5).at n=37A039837
- Each permutation in the list A060117 converted to Site Swap notation, with "zero throws" (fixed elements) replaced with n, the length of siteswap.at n=25A060495
- Sum of squares of digits of n is equal to the largest prime factor of n.at n=36A074302
- Eigensequence of triangle A039598: a(n) = Sum_{k=0..n-1} A039598(n-1,k)*a(k) for n>0 with a(0)=1.at n=7A125276
- Numbers k such that Sum_{x=2..k} (x-1)*3^(x-2) = ((2*k-3)*3^(k-1)+1)/4 is prime.at n=10A125567
- Triangle, read by rows of 2n+1 terms, where T(n,k) = T(n,k-1) + T(n-1,k-1) for 2n>=k>0, T(n,2n-1) = T(n,2n-2) + T(n-1,n-1) and T(n,2n) = T(n,2n-1) + T(n-1,n-1) for n>0, with T(n,0) = T(n-1,n-1) for n>0 and T(0,0) = 1.at n=48A132289
- Triangle, read by rows of 2n+1 terms, where T(n,k) = T(n,k-1) + T(n-1,k-1) for 2n>=k>0, T(n,2n-1) = T(n,2n-2) + T(n-1,n-1) and T(n,2n) = T(n,2n-1) + T(n-1,n-1) for n>0, with T(n,0) = T(n-1,n-1) for n>0 and T(0,0) = 1.at n=49A132289
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (-1, 1, 1), (1, 0, 1), (1, 1, -1)}.at n=8A149317
- Expansion of (1-x)/(1-5*x-2*x^2+8*x^3).at n=6A159616
- a(0)=2, a(1)=3, a(n) = 3 + a(n-1) + a(n-2) for n >= 2.at n=17A171237
- Numbers k such that there is 1 prime between 100*k and 100*k + 99.at n=10A186393
- Let f(x) = 1 + Sum_{j>=4} (|mu(j)| - |mu(j-1)|)*x^j, where mu(n) is the Möbius function (A008683). Then a(n) is n times the coefficient of x^n in the expansion of log(f(x)).at n=41A262400
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 389", based on the 5-celled von Neumann neighborhood.at n=27A271596
- Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 3 + 2*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 2*x - x^2.at n=30A367300