14688
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 48
- Divisor Sum
- 45360
- Proper Divisor Sum (Aliquot Sum)
- 30672
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4608
- Möbius Function
- 0
- Radical
- 102
- Omega Function (Ω)
- 9
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 133
- Smith Number
- yes
- 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
- Length of one version of Kolakoski sequence {A000002(i)} at n-th growth stage.at n=24A001083
- Index of (the image of) the modular group Gamma(n) in PSL_2(Z).at n=33A001766
- Expansion of (1-x)^(-3) * (1-x^2)^(-2).at n=31A002624
- a(n) = n*(n+1)*(n+2)^2/6.at n=16A004320
- Coefficients of Chebyshev polynomials.at n=14A005583
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/5).at n=18A011915
- Number of divisors of n!.at n=18A027423
- a(n) = (n+1)*binomial(n+1, 15).at n=3A027775
- Number of k's such that A002034(k) = n.at n=18A038024
- Denominators of continued fraction convergents to sqrt(823).at n=11A042589
- Triangular array T: put T(n,0)=n+1 for all n >= 0 and all other T(n,k)=0; then put T(n,k)=Sum{T(i,j): 0<=j<=i-n+k, n-k<=i<=n}.at n=35A053199
- Triangular array T: put T(n,0)=n for all n >= 0 and all other T(n,k)=0; then put T(n,k)=Sum{T(i,j): 0<=j<=i-n+k, n-k<=i<=n}.at n=43A054144
- Penrice Christmas gift numbers, Card-matching numbers (Dinner-Diner matching numbers): Triangle T(n,k) = number of ways to get k matches for a deck with n cards, 2 of each kind.at n=43A059056
- Order of commutator subgroup of GL(2,Z_n) (invertible 2 X 2 matrices mod n: A000252).at n=33A065430
- a(n) = phi(n^3 + n^2 + n + 1).at n=35A066792
- Numbers k such that phi(4k-1) = sigma(k).at n=6A067235
- Numbers n such that determinant[{{n,phi(n)},{n+1,phi(n+1)}}]is a perfect square.at n=12A067571
- Numbers k that divide phi(k)^2 + sigma(k)^2.at n=29A068484
- Numbers k such that phi(k) = 2*tau(k)^2.at n=20A068564
- Binomial transform of positive cubes.at n=7A084903