14214
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
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 29952
- Proper Divisor Sum (Aliquot Sum)
- 15738
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4488
- Möbius Function
- 1
- Radical
- 14214
- 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
- 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
- Expansion of e.g.f. exp(2*(exp(x) - 1)).at n=7A001861
- Coordination sequence for sigma-CrFe, Position Xd.at n=30A009959
- Coordination sequence for sigma-CrFe, Position Xb.at n=30A009960
- Numbers k such that 33*2^k+1 is prime.at n=27A032366
- Square of lower triangular matrix of A056857 (successive equalities in set partitions of n).at n=28A078937
- Triangular array read by rows: for n, k >= 1, a(n+1, 1) = 2*a(n, n); a(n+1, k+1) = a(n, k)+a(n+1, k).at n=28A129340
- Eigentriangle generated from A109128, row sums = expansion of {2(exp(x)-1)}.at n=44A144061
- Expansion of 2*x^2 *(4 +7*x +5*x^2 -x^3 -4*x^4 +6*x^6 +4*x^7 -x^8 -2*x^9) / ((1+x)^2 *(1+x+x^2)^2 *(1-x)^4) .at n=43A187062
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals upwards, where the e.g.f. of column k is exp(k*(e^x-1)).at n=47A189233
- Incorrect version of A001861.at n=6A191643
- a(n) = n^3/3 - 7*n/3 + 4.at n=35A270809
- Square array A(n,k), n>=0, k>=0, read by antidiagonals downwards, where column k is the expansion of e.g.f. exp(k*(exp(x) - 1)).at n=52A292860
- The number of trees with 4 nodes labeled by positive integers, where each tree's label sum is n.at n=48A301739
- Expansion of (chi(x) / chi(-x^6))^2 in powers of x where chi() is a Ramanujan theta function.at n=47A328790
- Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. exp(2 * (exp(x) - Sum_{j=0..k} x^j/j!)).at n=35A336345
- a(n) is the number of words of length n over the alphabet {a,b,c} with an even number of appearances of the letter 'a' and the sum of appearances of the letters 'b' and 'c' add up to at most 3.at n=23A341896
- Triangle read by rows. T(n, k) = BellPolynomial(n, k).at n=30A350256
- a(n) is the smallest number which can be represented as the sum of n distinct perfect powers (A001597) in exactly n ways, or -1 if no such number exists.at n=40A363040