5676
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 14784
- Proper Divisor Sum (Aliquot Sum)
- 9108
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1680
- Möbius Function
- 0
- Radical
- 2838
- 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
- 129
- 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
- Number of mixed Husimi trees with n nodes; or labeled polygonal cacti with bridges.at n=6A000314
- Fibonacci numbers written backwards.at n=20A004091
- Reversals of Fibonacci numbers (sorted).at n=19A004170
- Sum along upward diagonal of Pascal triangle to halfway point.at n=20A010754
- a(n) = floor( n*(n-1)*(n-2)/14 ).at n=44A011896
- a(n) = floor(n*(n-1)*(n-2)/15).at n=45A011897
- Expansion of 1/(1 - x^10 - x^11 - ...).at n=63A017904
- Expansion of 1/((1-x)(1-3x)(1-8x)(1-12x)).at n=3A021674
- 6 times triangular numbers: a(n) = 3*n*(n+1).at n=43A028896
- Numbers k such that 81*2^k+1 is prime.at n=46A032390
- Convolution of natural numbers n >= 1 with Lucas numbers L(k) (A000032) for k >= 3.at n=11A033813
- a(n) = binomial(n+6,6)*(6*n+7)/7.at n=6A034265
- a(n) = f(n,n-2) where f is given in A034261.at n=6A034275
- Number of binary [ n,6 ] codes without 0 columns.at n=11A034347
- T(n,n-5), array T as in A038730.at n=5A038734
- a(n) = T(3*n + 1, n + 1), array T as in A038792.at n=5A038736
- T(n,n-5), array T as in A038792.at n=15A038795
- Starting index of a string of exactly 3 consecutive equal digits in decimal expansion of Pi.at n=40A049519
- a(n) = C(n)*(7*n + 1) where C(n) = Catalan numbers (A000108).at n=6A050477
- Duplicate of A034265.at n=6A050485