14424
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 36120
- Proper Divisor Sum (Aliquot Sum)
- 21696
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4800
- Möbius Function
- 0
- Radical
- 3606
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 45
- 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) = dot_product(1,2,...,n)*(4,5,...,n,1,2,3).at n=32A026040
- a(n) = n^3 + n^2 + n.at n=24A027444
- Least term in period of continued fraction for sqrt(n) is 10.at n=25A031434
- Eigenvector of the triangle of distinct partitions (A008289), so that: a(n) = Sum_{k=1..tri(n)} A008289(n,k)*a(k) for n>=1 with a(1)=1, where tri(n) = floor((sqrt(8*n+1)-1)/2).at n=49A118399
- a(n) = 100*n^2 + 2*n.at n=11A158127
- a(n) = 576*n^2 + 24.at n=5A158637
- a(n) = 25*n^2 + n.at n=23A173089
- Fibonacci with priority for primes: a(0)=0, a(1)=1, for n >= 2, a(n) = a(n-1) + a(k), where 0 < k <= n-2 is maximal index such that a(n-1) + a(k) is prime. If there is no such k, then a(n) = a(n-1) + a(n-2).at n=27A216231
- Triangular array read by rows: T(n,k) is the number of compositions of n that have exactly k 3's; n>=0, 0<=k<=floor(n/3).at n=59A218796
- Numbers missing from A001032 despite satisfying the necessary congruence conditions (see comments).at n=34A274469
- Numbers missing from A134419 despite satisfying the necessary congruence conditions (see comments).at n=40A274471
- Take apart the sides of each of the integer-sided triangles with perimeter n (at their vertices) and rearrange them orthogonally in 3-space so that their endpoints coincide at a single point. a(n) is the total surface area of all rectangular prisms enclosed in this way.at n=30A308236
- Expansion of Product_{k=1..16} theta_3(q^k), where theta_3() is the Jacobi theta function.at n=31A320247
- Numbers k such that k and k + 1 are both Niven numbers in base 3/2 (A342426).at n=27A342427