14355
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 28080
- Proper Divisor Sum (Aliquot Sum)
- 13725
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6720
- Möbius Function
- 0
- Radical
- 4785
- Omega Function (Ω)
- 5
- 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
- 76
- 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
- no
- Odd
- yes
Appears in sequences
- Coefficient of x^8 in expansion of (1+x+x^2)^n.at n=7A005716
- From Apery continued fraction for zeta(3): zeta(3)=6/(5-1^6/(117-2^6/(535-3^6/(1463...)))).at n=7A006221
- Form array in which n-th row is obtained by expanding (1+x+x^2)^n and taking the 3rd column from the center.at n=8A014532
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having exactly k UUU's (triple rises) where U=(1,1). Rows have 1,1,1,2,3,4,5,... entries, respectively.at n=48A092107
- a(n) = (n+1)*(n+2)^2*(n+3)*(n+4)*(3*n+5)/240.at n=8A114243
- Triangle whose k-th column has e.g.f. exp(x)*sum{j=0..k, Bessel_I(k+j,2x)}.at n=57A116401
- Odd winning positions in Fibonacci nim.at n=37A120904
- Triangle read by rows: T(n,k) is the number of ternary words of length n on {0,1,2} having k drops (n>=0, k>=0). The drops of a ternary word on {0,1,2} are the subwords 10,20 and 21.at n=39A120906
- Triangle read by rows: T(n,k) is the number of ternary words of length n on {0,1,2} having k drops (n>=0, k>=0). The drops of a ternary word on {0,1,2} are the subwords 10,20 and 21.at n=41A120906
- Triangle read by rows: T(n,k) is the number of ternary words of length n with k strictly increasing runs (0 <= k <= n; for example, the ternary word 2|01|12|02|1|1|012|2 has 8 strictly increasing runs).at n=61A120987
- Triangle read by rows: T(n,k) is the number of ternary words of length n with k strictly increasing runs (0 <= k <= n; for example, the ternary word 2|01|12|02|1|1|012|2 has 8 strictly increasing runs).at n=63A120987
- 3 times 11-gonal (or hendecagonal) numbers: a(n) = 3*n*(9*n-7)/2.at n=33A153783
- a(n) = (n+1)*(n-2)*(n-3)/2.at n=30A212343
- Primitive values n such that the square with opposite corners (0,0) and (n,n) contains a point (x,y) with integer coordinates, with 0 < x,y < n, at an integer distance from three of the four corners.at n=24A260549
- a(n) = n*(n + 7)*(n + 14)*(n + 21)/24.at n=15A264447
- Number of length-4 0..n arrays with no repeated value greater than or equal to the previous repeated value.at n=9A269410
- Magic sums of 4 X 4 magic squares composed of squares.at n=24A271580
- Irregular triangle read by rows: T(n,m) = number of lattice paths of type A^H terminating at point (n, m).at n=33A291081
- Partitions with designated summands in which no parts are multiples of 3.at n=28A293569
- Expansion of 1/(1 + x + x^2/(1 + 2*x + x^2/(1 + 3*x + x^2/(1 + 4*x + x^2/(1 + ...))))), a continued fraction.at n=11A295289