13670
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24624
- Proper Divisor Sum (Aliquot Sum)
- 10954
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5464
- Möbius Function
- -1
- Radical
- 13670
- Omega Function (Ω)
- 3
- 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
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 5, starting 1,0,-1,1.at n=16A025279
- Dirichlet convolution of Fibonacci numbers with themselves.at n=19A034744
- Numbers k such that 295*2^k + 1 is prime.at n=24A053364
- Numbers k such that A000295(k) = 2^k-k-1 is prime.at n=11A099439
- Riordan array (1/(1-3x*c(x)),xc(x)), c(x) the g.f. of A000108.at n=48A117375
- a(n) = 441*n - 1.at n=30A158319
- Number of reducible Boolean polynomials of degree n with constant term 1.at n=17A169914
- Related to Pisano periods: numbers n such that there are n+10 distinct Fibonacci numbers mod n.at n=38A229467
- Number of nonconsecutive chess tableaux with n cells.at n=18A238020
- Growth series for affine Coxeter group (or affine Weyl group) D_6.at n=12A266761
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 429", based on the 5-celled von Neumann neighborhood.at n=26A272113
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 462", based on the 5-celled von Neumann neighborhood.at n=34A272311
- Sum of the largest parts of the partitions of n into 5 parts.at n=37A308827
- Number of semistandard rectangular plane partitions of n.at n=31A323432
- a(0) = 1; thereafter a(n) = 2*(6*n^2 - 3*n + 1).at n=34A386477