8334
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
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 18096
- Proper Divisor Sum (Aliquot Sum)
- 9762
- 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
- 2772
- Möbius Function
- 0
- Radical
- 2778
- 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
- 114
- 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
- A generalized difference set on the set of all integers (lambda = 1).at n=20A024431
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 5, starting 1,0,1,1.at n=13A025273
- Number of partitions satisfying cn(1,5) <= 1 and cn(4,5) <= 1.at n=43A039854
- Number of partitions satisfying 0 < cn(0,5) + cn(1,5) + cn(4,5) + cn(2,5) and 0 < cn(0,5) + cn(1,5) + cn(4,5) + cn(3,5).at n=32A039904
- Rhombi (in 3 different orientations) in a rhombus with 60-degree acute angles.at n=26A052153
- Number of singular points on n-th order Chmutov surface.at n=27A057870
- Column 6 of triangle A091602.at n=39A091609
- Number of partitions of n in which no parts are multiples of 25.at n=32A092885
- Numbers k such that k + prime(k) gives a triangular number.at n=32A115882
- Partial sums of A004977.at n=24A116100
- Main diagonal of array A[k,n] = n-th sum of 3 consecutive k-gonal numbers, k>2.at n=17A130423
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 0110-1111 pattern in any orientation.at n=19A146386
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (0, 1, -1), (1, 0, 0)}.at n=11A148016
- a(n)=(F(n)-sumofdigits(F(n)))/9, where F(n) = A000045(n).at n=25A181065
- E.g.f. satisfies A(x) = (1-x*A(x))^(-x*A(x)).at n=6A184949
- Triangle T(n,k) for solving differential equation A'(x)=G(A(x)), G(0)!=0.at n=63A190015
- G.f.: exp( Sum_{n>=1} x^n/n * Sum_{k=0..n} binomial(n,k)^2 * x^k/(1-x)^k ).at n=11A217333
- Equals one maps: number of nX5 binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..1 nX5 array.at n=2A220576
- T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..1 nXk array.at n=23A220579
- Equals one maps: number of 3Xn binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..1 3Xn array.at n=4A220581