14232
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 35640
- Proper Divisor Sum (Aliquot Sum)
- 21408
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4736
- Möbius Function
- 0
- Radical
- 3558
- Omega Function (Ω)
- 5
- 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
- yes
- 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
- a(n) = T(2*n-1, n-2), where T is given by A026519.at n=7A026529
- Quotient of 'base-3' division described in A032537.at n=29A032538
- Let n be a positive integer, n>3. Define a tournament on the vertex set {2,3,..,n} by: for i < j, i is adjacent to j if i divides j, else j is adjacent to i. If T(n) denotes its adjacency matrix, then the above sequence is det(T(n))for n=4,5,6....42.at n=20A057980
- Numerators of coefficients in quasimodular form F_3(q) of level 1 and weight 12.at n=7A126859
- a(n) = 1728*n - 1320.at n=8A157263
- Number of (n+2)X(n+2) 0..2 matrices with each 3X3 subblock idempotent.at n=9A224598
- Number of n-node rooted identity trees of height 9.at n=8A229403
- Number of partitions p of n such that the m(M(p)) is a part, where m = multiplicity, M = the maximum multiplicity of the parts of p.at n=41A240538
- Number of 2n-node rooted identity trees of height n.at n=9A245090
- Expansion of Sum_{k>=1} phi(k) * x^k/(1 - x^k)^4, where phi = Euler totient function (A000010).at n=42A309323
- Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1, k) + 2*T(n-1, k-1) + 3*T(n-1, k-2) + 4*T(n-1, k-3) + 5*T(n-1, k-4) + 6*T(n-1, k-5) for k = 0..5*n; T(n,k)=0 for n or k < 0.at n=51A319092
- Triangle read by rows: binomial transform of triangle A330140.at n=51A330141
- a(n) = exp(-1/2) * Sum_{k>=0} (2*k + n)^n / (2^k * k!).at n=5A337012
- a(n) = (n^3 + 6*n^2 + 17*n + 6)/6.at n=42A341209
- Nonnegative integers k such that k! mod nextprime(k) is larger than k.at n=13A360805