8895
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14256
- Proper Divisor Sum (Aliquot Sum)
- 5361
- 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
- 4736
- Möbius Function
- -1
- Radical
- 8895
- 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
- 70
- 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
- Smallest number such that n-th iterate of Chowla function is 0.at n=21A002954
- Lucky numbers that are decimal concatenations of n with n + 7.at n=11A032657
- Number of unlabeled rooted trees with n leaves in which the degrees of the root and all internal nodes are >= 3.at n=18A052525
- Engel expansion of 1/log(2) = 1.4427...at n=13A059183
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals 3n.at n=41A070899
- Number of transpose partition pairs of order n whose number of odd parts differ by numbers of the form 4*k + 2.at n=39A190101
- Number of 4 X n arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 4 X n array.at n=35A220034
- Partitions with parts repeated at most twice and repetition only allowed if first part has an even index (first index = 1).at n=50A227135
- Number of simple connected graphs with n nodes that are planar and have no subgraph isomorphic to the open-bowtie graph.at n=9A243794
- Numbers of the form (prime(k) + Fibonacci(k))/2.at n=13A261543
- Number of partitions of n such that the (sum of distinct odd parts) > n/2.at n=40A284614
- Number of partitions of n such that the (sum of distinct odd parts) >= n/2.at n=40A284615
- Expansion of Product_{k>=0} (1-x^(3*k+2))^(3*k+2).at n=32A285212
- Numbers k such that 3^k - k + 1 is prime.at n=7A308829
- Number of Lyndon compositions (aperiodic necklaces of positive integers) with sum n and adjacent parts (including the last with the first part) being indivisible (either way).at n=34A318747
- Total number of edges in graph formed by the straight line segments connecting the edges of an equilateral triangle with the n-1 points resulting from a subdivision of the sides into n equal pieces.at n=38A332376
- a(n) is the number of edges formed by n-secting the angles of an equilateral triangle.at n=38A335412
- Number of regions formed at generation n when the Conant "warp and woof" construction is applied to the base and left side of an equilateral triangle.at n=16A337270
- G.f. satisfies A(x) = exp( Sum_{k>=1} (A(x^k) + A(w*x^k) + A(w^2*x^k))/3 * x^k/k ), where w = exp(2*Pi*i/3).at n=29A363404
- Expansion of (1/x) * Series_Reversion( x / ((1+x)^2 * (1+x+x^3)) ).at n=6A369482