14224
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 31744
- Proper Divisor Sum (Aliquot Sum)
- 17520
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6048
- Möbius Function
- 0
- Radical
- 1778
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 3
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
- 151
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = A001950 (upper Wythoff sequence).at n=23A024465
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A001950 (upper Wythoff sequence).at n=23A025085
- Numbers whose set of base-15 digits is {3,4}.at n=23A032839
- Configurations of linear chains for a square lattice.at n=9A033155
- a(n) = prime(n)*prime(n+1) - prime(n+1).at n=29A037167
- Triangle read by rows: T(n,k) = number of Schroeder paths of length 2n and having k ascents.at n=39A090981
- Smallest k such that the fundamental unit (x+y*w) or (x+y*w)/2 of the real quadratic field Q(sqrt(k)) obeys gcd(k,y)=n.at n=14A197170
- Number of (unlabeled) connected loopless multigraphs such that the sum of the numbers of vertices and edges is n.at n=17A265582
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 229", based on the 5-celled von Neumann neighborhood.at n=6A270947
- Number of n X 3 0..1 arrays with each 1 horizontally or vertically adjacent to 2 or 3 1's.at n=8A295208
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally or vertically adjacent to 2 or 3 1s.at n=57A295213
- G.f.: Sum_{k>=1} x^k/(1-x^k) * Product_{k>=1} 1/(1-x^k)^2.at n=15A305119
- a(0) = 1; a(n) = Sum_{k=1..n} -lambda(k+1)*a(n-k), where lambda() is the Liouville function (A008836).at n=25A307240
- a(n) = Sum_{d|n} (n-d)^tau(n/d).at n=24A345274
- Numbers k such that k and k+1 have the same sum of 5-smooth divisors.at n=9A355713
- Number of non Wilf and non conjugate Wilf integer partitions of n.at n=36A383530
- Expansion of (1/x) * Series_Reversion( x / (1 + x + x^3 * (1 + x)^2) ).at n=11A389131