6008
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11280
- Proper Divisor Sum (Aliquot Sum)
- 5272
- 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
- 3000
- Möbius Function
- 0
- Radical
- 1502
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 142
- 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
- Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^8 in powers of x.at n=34A001486
- Numbers k such that Fib(k) == 21 (mod k).at n=39A023179
- a(n) = least 2k such that p is the least prime in a Goldbach partition of 2k, where p = prime(n).at n=30A025017
- Composite numbers not ending in zero that yield a prime when turned upside down.at n=31A048889
- Number of strongly connected tournaments on n nodes.at n=8A051337
- Closed walks of length n along the edges of a pentagon based at a vertex.at n=15A054877
- Numbers k for which there exists some m such that k = Sum_{i=1..1+floor(log_10(k))} binomial(m, d_i), where d_i is the i-th digit of k.at n=20A055481
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 11 (most significant digit on right).at n=5A061964
- a(n) = Sum_{k=0..n} binomial(5*n,5*k).at n=3A070782
- Index of smallest Fibonacci number beginning with the n-th Fibonacci number other than itself.at n=21A072520
- G.f. satisfies: A(x) = A(x^2) + x*A(x^2)^2.at n=61A073711
- Self-convolution of A073711.at n=30A073712
- a(1) = 1; a(n) = Sum_{k=1..n-1} a(floor((n-1)/k)).at n=39A078346
- Number of walks of length 2n+1 between two nodes at distance 5 in the cycle graph C_10.at n=5A095933
- a(1) = 2, a(n) = a(n-1) + 3*(a(n-1)-floor(a(n-1)^(1/3))^3).at n=17A096295
- Consider the family of multigraphs enriched by the species of mod-6 sets. Sequence gives number of those multigraphs with 6n loops and arcs.at n=2A099690
- Even numbers n such that n^2 is an arithmetic number.at n=25A107924
- Matrix logarithm of triangle A111553.at n=39A111560
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k UUU's (triplerises) (n >= 0; 0 <= k <= n-2 for n >= 2).at n=34A128719
- Numbers k such that 12^k + 11 is prime.at n=5A137654