14421
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
- 23040
- Proper Divisor Sum (Aliquot Sum)
- 8619
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7920
- Möbius Function
- 1
- Radical
- 14421
- 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
- no
- Odd
- yes
Appears in sequences
- Fermat coefficients.at n=8A000972
- Coefficient of x^4 in expansion of (1+x+x^2)^n.at n=21A005712
- 10-gonal (or decagonal) pyramidal numbers: a(n) = n*(n + 1)*(8*n - 5)/6.at n=22A007585
- Repeatedly convert from decimal to octal.at n=21A008558
- a(n) = floor(C(n,6)/7).at n=23A011797
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t(n)=2*n+1 (odd numbers).at n=42A023865
- Number of necklaces with 7 black beads and n-7 white beads.at n=17A032192
- Number of diagonal dissections of an n-gon into 3 regions.at n=18A033275
- a(n) = (2*n+1)*(9*n+1).at n=28A033573
- Schoenheim bound L_1(n,7,6).at n=16A036834
- Truncated square pyramid numbers: a(n) = Sum_{k = n..2*n} k^2.at n=18A050409
- T(n,7), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 7 black beads and n-7 white beads.at n=17A051172
- Number of wide partitions of n.at n=49A070830
- Non-palindromic n and its digit reversal have the same sum of prime factors (with repetition).at n=34A085607
- Convolution of Jacobsthal(n) and 3^n.at n=9A094705
- Quotients T(p,k)/p, where T(p,k) is the sub-triangle defined in A096539 of the triangle of coefficients of Lucas polynomials (cf. A034807).at n=66A096540
- The n-th n-gonal number divisible by n.at n=10A117669
- Related to enumeration of alkane systems - see reference for precise definition.at n=8A121179
- a(n) = Sum_{k=0..floor(n/2)} (n-k)^2.at n=36A129371
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (1, 0, 0), (1, 0, 1), (1, 1, 0)}.at n=7A151093