14674
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 11246
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6160
- Möbius Function
- 1
- Radical
- 14674
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 177
- 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
- a(n) = n*(n+1)*(n+2)*(n+7)/24.at n=22A005582
- a(n) = a(n-1) + a(n-8), with a(i) = 1 for i = 0..7.at n=50A005710
- a(n) = n*(n-1) + (n-2)*(n-3) + ... + 1*0 + 1 for n odd; otherwise, a(n) = n*(n-1) + (n-2)*(n-3) + ... + 2*1.at n=43A014112
- Numbers k such that sigma(k) = sigma(k+11).at n=10A015881
- Expansion of 1/(1 - x^8 - x^9 - ...).at n=58A017902
- Self-convolution of composite numbers.at n=29A023648
- Numbers k such that k^18 == 1 (mod 19^3).at n=39A056089
- Numbers n such that sum of cubes of even digits of n equals sum of cubes of odd digits of n.at n=3A076165
- Delete first column (index 0) and all rows having nonprime index of triangle T(p,k) defined in A034807 (coefficients of Lucas polynomials). Sequence gives resulting sub-triangle read by rows.at n=49A096539
- Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k hills (i.e., ud's starting at level 0). (A Grand Motzkin path is a path in the half-plane x>=0, starting at (0,0), ending at (n,0) and consisting of steps u=(1,1), d=(1,-1) and h=(1,0).).at n=36A109191
- Number of Grand Motzkin paths of length n and having no hills (i.e., no ud's starting at level 0). (A Grand Motzkin path of length n is a path in the half-plane x >= 0, starting at (0,0), ending at (n,0) and consisting of steps u=(1,1), d=(1,-1) and h=(1,0).)at n=11A109192
- Numbers n such that p(9n) is prime, where p(n) is the number of partitions of n.at n=24A114169
- Triangle T(n,k) = coefficient [x^n] of x^2/(1-(k+1)*x^2-x^3) for row n, and columns k = 0..n, read by rows.at n=65A117724
- G.f.: exp( Sum_{n>=1} (Sum_{d|n} d*x^d)^n/n ).at n=14A192860
- Triangle of numbers generated by the Nekrasov-Okounkov formula.at n=23A210590
- Number of indecomposable slim semimodular lattices of length n.at n=8A217945
- a(n) = 1*2 + 3*4 + 5*6 + 7*8 + 9*10 + 11*12 + 13*14 + ... + (up to n).at n=43A228958
- Triangle read by rows of coefficients of polynomials generated by the Han/Nekrasov-Okounkov formula.at n=23A234937
- Numbers n such that the decimal expansions of both n and n^2 have 1 as smallest digit and 7 as largest digit.at n=39A257210
- a(n) = n*(n + 1)*(4*n - 1)/3.at n=22A268684