12664
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23760
- Proper Divisor Sum (Aliquot Sum)
- 11096
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6328
- Möbius Function
- 0
- Radical
- 3166
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- 169
- 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
- Narayana's cows sequence: a(0) = a(1) = a(2) = 1; thereafter a(n) = a(n-1) + a(n-3).at n=26A000930
- Bisection of A000930.at n=13A002478
- Aliquot sequence starting at 180.at n=15A008891
- a(n) is the sum of squares of the first n positive integers congruent to 2 mod 3.at n=15A024394
- Number of nonisomorphic groupoids with 1 idempotent and a nontrivial symmetry.at n=3A030254
- Triangle: T(n,k), k<=n: groupoids with a nontrivial symmetry with n elements and k idempotents.at n=11A038020
- Pisot sequence P(4,6).at n=21A048625
- Pisot sequence P(6,9).at n=20A048626
- Number of factorizations with 2 levels of parentheses indexed by prime signatures. A050338(A025487).at n=34A050339
- Expansion of (1-x)^3/(1 - 4*x + 3*x^2 - x^3).at n=9A052529
- Euler transform applied three times to partition triangle A008284.at n=53A055886
- Number of partitions of n into distinct partition numbers.at n=24A068006
- Number of ways to tile a 2 X n room with 1 X 2 Tatami mats. At most 3 Tatami mats may meet at a point.at n=25A068921
- a(n) = a(n-1) + a(n-3) for n >= 3, with a(0) = 1, a(1) = a(2) = 0. This recurrence can also be used to define a(n) for n < 0.at n=29A078012
- Square array read by antidiagonals associated with sections of 1/(1-x-x^k).at n=69A099239
- a(n) = Sum_{k=0..floor(n/3)} C(n-2k,k-1).at n=28A099560
- Sequence A000930 with terms repeated.at n=52A108104
- Sequence A000930 with terms repeated.at n=53A108104
- a(n)= +a(n-3) +2*a(n-6) +a(n-9).at n=42A109531
- a(n)= +a(n-3) +2*a(n-6) +a(n-9).at n=40A109531