13386
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 28224
- Proper Divisor Sum (Aliquot Sum)
- 14838
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4224
- Möbius Function
- 1
- Radical
- 13386
- Omega Function (Ω)
- 4
- 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
- 94
- 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
- Numbers that are the sum of 11 positive 8th powers.at n=24A003389
- Fibonacci sequence beginning 8, 17.at n=15A022390
- a(n) is least k such that k and 8k are anagrams in base n (written in base 10).at n=13A023100
- Number of permutations (p1,...,pn) such that 1 <= |pk - k| <= 2 for all k.at n=17A033305
- Expansion of Product_{k>=1} 1/(1 - 2*t^k).at n=12A070933
- a(n+2) = 5a(n+1) - 3a(n) (n >= 1); a(0) = 1, a(1) = 2, a(2) = 9.at n=7A095939
- Khinchin primes: values of n such that the concatenation of the first n decimal digits of Khinchin's constant is prime.at n=6A118327
- a(n) = (2*n^3 + 5*n^2 - 9*n)/2.at n=22A162258
- Expansion of (1-3x+5x^2-x^3)/(1-3x+x^2)^2.at n=8A167477
- Number of (n+1) X 2 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly one clockwise edge increases.at n=5A207043
- Number of (n+1) X 7 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly one clockwise edge increases.at n=0A207048
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases.at n=15A207050
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases.at n=20A207050
- T(n,k)=Number of nXk binary arrays with top left element equal to 1 and no two ones adjacent horizontally or antidiagonally.at n=42A228754
- Number of 7Xn binary arrays with top left element equal to 1 and no two ones adjacent horizontally or antidiagonally.at n=2A228759
- Numbers k such that A248891(k) = 3.at n=45A248903
- Number of (n+2)X(3+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 1 3 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 1 3 6 or 7.at n=7A252300
- a(n) = Sum_{k=1..n-1}((k mod 5)*a(n-k)), a(1) = 1.at n=11A259714
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 803", based on the 5-celled von Neumann neighborhood.at n=21A273578
- Number of permutations of [n] with no fixed points where the maximal displacement of an element equals two.at n=15A321048