8622
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 18720
- Proper Divisor Sum (Aliquot Sum)
- 10098
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2868
- Möbius Function
- 0
- Radical
- 2874
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 171
- 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
- Numbers k such that k | sigma_13(k) - phi(k)^13.at n=18A055707
- Numbers k such that S(k+2) = d(k)+2, where S(k) is the Kempner function (A002034) and d(k) is the number of divisors of k (A000005).at n=39A073535
- Consider the triangle in which the j-th row begins with prime(j) and is the arithmetic progression with least common difference such that the remaining j-1 terms are composite and not divisible by prime(j). Sequence gives last term in each row.at n=23A095182
- a(n) = Min{x : A073124(x) = 2n}.at n=35A096480
- Number of ways to label the vertices of the octahedron (or faces of the cube) with nonnegative integers summing to n, where labelings that differ only by rotation or reflection are considered the same.at n=30A097513
- Positive integers not appearing in sequence A098572, which calculates the values of floor(sum(m^(1/m),n=1..m)).at n=41A098573
- Where records occur in A111229.at n=49A111271
- Numbers k such that the sum of the first k primes is prime and the sum of the squares of the first k primes is also prime.at n=40A124225
- Coefficient of x^2 in the polynomial (x-p(n))*(x-p(n+1))*(x-p(n+2))*(x-p(n+3)), where p(k) is the k-th prime.at n=10A127348
- Expansion of 1/(1 - x^2 - x^7 - x^12 + x^14) (a Salem polynomial).at n=56A143619
- Number of planar n X n X n binary triangular grids symmetric under 120 degree rotation with no more than 2 ones in any 5 X 5 X 5 subtriangle.at n=15A153917
- Number of nondecreasing integer sequences of length 14 with sum zero and sum of absolute values 2n.at n=12A158148
- Positions of zeros in A165582.at n=40A165583
- Number of perfect powers (A001597) < 2^n.at n=26A188951
- a(n) = 3^(n-1) + C(2*n, n)/2.at n=7A191993
- Number of (n+1) X 2 0..1 arrays with the number of rightwards and downwards edge increases in each 2 X 2 subblock differing from the number in all its horizontal and vertical neighbors.at n=7A205065
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the number of rightwards and downwards edge increases in each 2X2 subblock differing from the number in all its horizontal and vertical neighbors.at n=28A205072
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the number of rightwards and downwards edge increases in each 2X2 subblock differing from the number in all its horizontal and vertical neighbors.at n=35A205072
- Numbers k such that 3^k + 10 is prime.at n=20A217137
- O.g.f.: A(x) = Sum_{n>=0} n^n*x^n/(1-n*x)^(2*n)/n! * exp(-n*x/(1-n*x)^2).at n=6A218680