8686
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13464
- Proper Divisor Sum (Aliquot Sum)
- 4778
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4200
- Möbius Function
- -1
- Radical
- 8686
- 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
- 52
- 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
- Pseudoprimes to base 87.at n=42A020215
- Numerators of continued fraction convergents to sqrt(343).at n=6A041648
- Integer nearest to 10^n / log(10^n).at n=4A057834
- Solution to the non-squashing boxes problem (version 1).at n=31A089054
- Number of 4-step E, S, NW and NE-moving king's tours on an n X n board summed over all starting positions.at n=13A187587
- Numbers k such that (2^k + k + 1)*2^k - 1 is prime.at n=6A201357
- Number of partitions p of n such that max(p)-min(p) = 5.at n=47A218568
- Even integers concatenated with themselves.at n=42A248422
- Number of (n+1) X (4+1) 0..3 arrays with every 2 X 2 subblock summing to 6 and no 2 X 2 subblock having exactly two nonzero entries.at n=3A251232
- T(n,k) = Number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock summing to 6 and no 2 X 2 subblock having exactly two nonzero entries.at n=24A251236
- The number of overpartitions of n into parts congruent to 2, 4, or 5 modulo 6.at n=44A253136
- Numbers n such that n^k is zeroless for k=0,...,6.at n=24A253647
- Expansion of Product_{k>=1} (1 + k^3*x^k).at n=8A265840
- Numbers n such that 3*14^n-1 is prime.at n=17A270011
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 387", based on the 5-celled von Neumann neighborhood.at n=24A271545
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 734", based on the 5-celled von Neumann neighborhood.at n=25A273455
- Numbers with digits 6 and 8 only.at n=24A284635
- The number of partitions of n which represent Chomp positions with Sprague-Grundy value 4.at n=50A284690
- Number of minimal dominating sets in the n-gear graph.at n=12A290378
- Number of n-node Stanley graphs without isolated nodes.at n=7A323842