5685
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
- 8
- Divisor Sum
- 9120
- Proper Divisor Sum (Aliquot Sum)
- 3435
- 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
- 3024
- Möbius Function
- -1
- Radical
- 5685
- 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
- 36
- 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
- no
- Odd
- yes
Appears in sequences
- Cluster series for site percolation problem on honeycomb matching lattice (honeycomb structure with 1st, 2nd and 3rd neighbors connected).at n=5A003200
- Pseudoprimes to base 86.at n=30A020214
- Pseudoprimes to base 94.at n=42A020222
- Least m such that if r and s in {1/1, 1/3, 1/6,..., 1/C(n+1,2)} satisfy r < s, then r < k/m < s for some integer k.at n=30A024826
- Duplicate of A003200.at n=4A036399
- Number of partitions satisfying (cn(0,5) <= cn(2,5) = cn(3,5)).at n=42A036804
- For n weights, number of combinations when limited to two weights per pan.at n=15A037255
- Starting positions of strings of 2 0's in the decimal expansion of Pi.at n=40A050201
- 15-gonal (or pentadecagonal) numbers: n*(13n-11)/2.at n=30A051867
- Expansion of series related to Liouville's Last Theorem: g.f. Sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^3 *Product_{i=1..t} (1-x^i) ).at n=37A059820
- Centered 14-gonal numbers.at n=28A069127
- Positive integers such that the smallest positive real solution to x^n + x = 2*Pi*a(n) forms a monotonically increasing sequence as n grows.at n=11A080019
- Numbers m such that the numerator of Sum_{i=1..m} (i-1)/i is prime.at n=48A091815
- Triangle read by rows: T(n,k) is number of Dyck n-paths with k UUDDs, 0 <= k <= n/2.at n=46A098978
- Iccanobirt prime indices (14 of 15): Indices of prime numbers in A102124.at n=16A102144
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k doubledescents (i.e., dd's).at n=38A108428
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k doubledescents (i.e., dd's).at n=35A108428
- Expansion of c(x^2+x^3), c(x) the g.f. of A000108.at n=15A115178
- Number of n X n binary arrays with all ones connected only in a 1001-1111-1001 pattern in any orientation.at n=8A146925
- a(n) = 196*n + 1.at n=28A158223